Papers
Topics
Authors
Recent
Search
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 ΣR<sup>n\Sigma\subset\mathbb{R}<sup>n 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 AA on R<sup>n\mathbb{R}<sup>n is a self-similarity of a cut-and-project set Σ\Sigma, i.e.\ satisfies AΣΣA\Sigma\subset\Sigma. We characterize such mappings AA and provide a construction of a suitable cut-and-project set Σ\Sigma. We determine minimal dimension of a lattice which permits construction of such a set Σ\Sigma.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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