English

Complexity of Cut-and-Project Sets of Polytopal Type in Special Homogeneous Lie Groups

Group Theory 2022-05-25 v1 Combinatorics Dynamical Systems

Abstract

The aim of this paper is to determine the asymptotic growth rate of the complexity function of cut-and-project sets in the non-abelian case. In the case of model sets of polytopal type in homogeneous two-step nilpotent Lie groups we can establish that the complexity function asymptotically behaves like rhomdim(G)dim(H)r^{homdim(G) dim(H)}. Further we generalize the concept of acceptance domains to locally compact second countable groups.

Keywords

Cite

@article{arxiv.2205.11897,
  title  = {Complexity of Cut-and-Project Sets of Polytopal Type in Special Homogeneous Lie Groups},
  author = {Peter Kaiser},
  journal= {arXiv preprint arXiv:2205.11897},
  year   = {2022}
}

Comments

43 pages, 3 figures