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
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.