Abstract

Fix any λ∈Cλ\in\mathbb{C}. We say that a set S⊆CS\subseteq\mathbb{C} is λλ-convexconvex if, whenever aa and bb are in SS, the point (1−λ)a+λb(1-λ)a+λb is also in SS. If SS is also (topologically) closed, then we say that SS is λλ-clonvexclonvex. We investigate the properties of λλ-convex and λλ-clonvex sets and prove a number of facts about them. Letting Rλ⊆CR_λ\subseteq\mathbb{C} be the least λλ-clonvex superset of {0,1}\{0,1\}, we show that if RλR_λ is convex in the usual sense, then RλR_λ must be either [0,1][0,1] or R\mathbb{R} or C\mathbb{C}, depending on λλ. We investigate which λλ make RλR_λ convex, derive a number of conditions equivalent to RλR_λ being convex, and give several conditions sufficient for RλR_λ to be convex or not convex; in particular, we show that RλR_λ is either convex or uniformly discrete. Letting $\mathcal{C} := \{λ\in\mathbb{C}\mid \mbox{$R_λ$ is convex}\}$, we show that C∖C\mathbb{C}\setminus\mathcal{C} is closed, discrete and contains only algebraic integers. We also give a sufficient condition on λλ for RλR_λ 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.