Abstract
Fix any . We say that a set is - if, whenever and are in , the point is also in . If is also (topologically) closed, then we say that is -. We investigate the properties of -convex and -clonvex sets and prove a number of facts about them. Letting be the least -clonvex superset of , we show that if is convex in the usual sense, then must be either or or , depending on . We investigate which make convex, derive a number of conditions equivalent to being convex, and give several conditions sufficient for to be convex or not convex; in particular, we show that is either convex or uniformly discrete. Letting $\mathcal{C} := \{λ\in\mathbb{C}\mid \mbox{$R_λ$ is convex}\}$, we show that is closed, discrete and contains only algebraic integers. We also give a sufficient condition on for and some other related -convex sets to be discrete by introducing the notion of a strong PV number. These conditions give rise to a number of periodic and aperiodic Meyer sets (the latter sometimes known as "quasicrystals"). The paper is in four parts. Part I describes basic properties of -convex and -clonvex sets, including convexity versus uniform discreteness. Part II explores the connections between -convex sets and quasicrystals and displays a number of such sets, including several with dihedral symmetry. Part III generalizes a result from Part I about the -convex closure of a path, and Part IV contains our conclusions and open problems.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.