The cyclicity rank of empty lattice simplices
Abstract
We are interested in algebraic properties of empty lattice simplices , that is, d-dimensional lattice polytopes containing exactly d+1 points of the integer lattice Zd. The cyclicity rank of is the minimal number of cyclic subgroups that the quotient group of splits into. It is known that up to dimension d ≤ 4, every empty lattice d-simplex is cyclic, meaning that its cyclicity rank is at most 1. We determine the maximal possible cyclicity rank of an empty lattice d-simplex for dimensions d ≤ 8, and determine the asymptotics of this number up to a logarithmic term.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.