Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 34 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 130 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Fixed-Parameter Extrapolation and Aperiodic Order (1212.2889v6)

Published 12 Dec 2012 in math.CV, math-ph, math.MG, and math.MP

Abstract: Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that $S$ is $\lambda$-$clonvex$. We investigate the properties of $\lambda$-convex and $\lambda$-clonvex sets and prove a number of facts about them. Letting $R_\lambda\subseteq\mathbb{C}$ be the least $\lambda$-clonvex superset of ${0,1}$, we show that if $R_\lambda$ is convex in the usual sense, then $R_\lambda$ must be either $[0,1]$ or $\mathbb{R}$ or $\mathbb{C}$, depending on $\lambda$. We investigate which $\lambda$ make $R_\lambda$ convex, derive a number of conditions equivalent to $R_\lambda$ being convex, and give several conditions sufficient for $R_\lambda$ to be convex or not convex; in particular, we show that $R_\lambda$ is either convex or uniformly discrete. Letting $\mathcal{C} := {\lambda\in\mathbb{C}\mid \mbox{$R_\lambda$ is convex}}$, we show that $\mathbb{C}\setminus\mathcal{C}$ is closed, discrete and contains only algebraic integers. We also give a sufficient condition on $\lambda$ for $R_\lambda$ and some other related $\lambda$-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 $\lambda$-convex and $\lambda$-clonvex sets, including convexity versus uniform discreteness. Part II explores the connections between $\lambda$-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 $\lambda$-convex closure of a path, and Part IV contains our conclusions and open problems.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.