Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices
Matthias Beck, Serkan Hosten
Abstract
The coordination sequence of a lattice Ł encodes the word-length function with respect to M, a set that generates Ł as a monoid. We investigate the coordination sequence of the cyclotomic lattice Ł= [ζm], where ζm is a primitive mþ root of unity and where M is the set of all mþ roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function of the coordination sequence; this structure depends on the prime factorization of m. Our methods are based on unimodular triangulations of the mþ cyclotomic polytope, the convex hull of the m roots of unity in ϕ(m), with respect to a canonically chosen basis of Ł.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan