English

The cyclicity rank of empty lattice simplices

Combinatorics 2025-03-10 v2

Abstract

We are interested in algebraic properties of empty lattice simplices Δ\Delta, that is, dd-dimensional lattice polytopes containing exactly d+1d+1 points of the integer lattice Zd\mathbb{Z}^d. The cyclicity rank of Δ\Delta is the minimal number of cyclic subgroups that the quotient group of Δ\Delta splits into. It is known that up to dimension d4d \leq 4, every empty lattice dd-simplex is cyclic, meaning that its cyclicity rank is at most 11. We determine the maximal possible cyclicity rank of an empty lattice dd-simplex for dimensions d8d \leq 8, and determine the asymptotics of this number up to a logarithmic term.

Keywords

Cite

@article{arxiv.2407.01179,
  title  = {The cyclicity rank of empty lattice simplices},
  author = {Lukas Abend and Matthias Schymura},
  journal= {arXiv preprint arXiv:2407.01179},
  year   = {2025}
}

Comments

16 pages, 1 figure, correction in Prop. 2.2 and cleaner proofs in Sect. 3