Fixed-Parameter Extrapolation and Aperiodic Order

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…