2000 character limit reached
On generalized self-similarities of cut-and-project sets
Published 24 Sep 2019 in math-ph, math.DS, and math.MP | (1909.10753v2)
Abstract: Cut-and-project sets represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project sets find application in solid state physics as mathematical models of atomic positions in quasicrystals, the description of their symmetries is therefore of high importance. We focus on the question when a linear map on is a self-similarity of a cut-and-project set , i.e.\ satisfies . We characterize such mappings and provide a construction of a suitable cut-and-project set . We determine minimal dimension of a lattice which permits construction of such a set .
Paper Prompts
Sign up for free to create and run prompts on this paper.