Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices. Matthias Beck & Serkan Hoşten San Francisco State University

Similar documents
Noncrossing sets and a Graßmann associahedron

Classification of Ehrhart quasi-polynomials of half-integral polygons

CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais

Discrete Volume Computations. for Polyhedra

ROOT POLYTOPES AND GROWTH SERIES OF ROOT LATTICES

Interval-Vector Polytopes

Lattice-point generating functions for free sums of polytopes

A combinatorial proof of a formula for Betti numbers of a stacked polytope

STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M. MASUDA

SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE

Newton Polygons of L-Functions

The important function we will work with is the omega map ω, which we now describe.

MATH 890 HOMEWORK 2 DAVID MEREDITH

arxiv: v1 [math.co] 12 Dec 2017

Lecture 12 March 4th

arxiv: v2 [math.co] 24 Aug 2016

SIMION S TYPE B ASSOCIAHEDRON IS A PULLING TRIANGULATION OF THE LEGENDRE POLYTOPE

Triangulations Of Point Sets

Algebra II: Review Exercises

Polytopes Course Notes

Lifts of convex sets and cone factorizations

Essential bases, semigroups and toric degenerations

h-polynomials of triangulations of flow polytopes (Cornell University)

751 Problem Set I JWR. Due Sep 28, 2004

Homology of Simplicial Complexes

arxiv: v1 [math.co] 24 Aug 2009

1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying.

Gelfand-Tsetlin Polytopes

Classification of smooth Fano polytopes

4. Simplicial Complexes and Simplicial Homology

arxiv: v1 [math.co] 22 Dec 2016

Math 5593 Linear Programming Lecture Notes

HIGHER-DIMENSIONAL FROBENIUS GAPS

LECTURE 1 Basic definitions, the intersection poset and the characteristic polynomial

1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This is from Bona Chapter 1 (1).

Lattice points in Minkowski sums

SPERNER S LEMMA MOOR XU

A non-partitionable Cohen-Macaulay simplicial complex

SEQUENTIALLY COHEN-MACAULAY GRAPHS OF FORM θ n1,...,n k. Communicated by Siamak Yassemi. 1. Introduction

arxiv: v1 [math.at] 8 Jan 2015

The Charney-Davis conjecture for certain subdivisions of spheres

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Toric Cohomological Rigidity of Simple Convex Polytopes

Mathematical and Algorithmic Foundations Linear Programming and Matchings

Homological theory of polytopes. Joseph Gubeladze San Francisco State University

THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE

FACE ENUMERATION FOR LINE ARRANGEMENTS IN A 2-TORUS

COMBINATORIAL COMMUTATIVE ALGEBRA. Fatemeh Mohammadi (University of Bristol)

Circuit Walks in Integral Polyhedra

POLYTOPES. Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of convex polytopes.

h -vectors, Eulerian polynomials and stable polytopes of graphs

Constructing self-dual chiral polytopes

The simplex method and the diameter of a 0-1 polytope

Elementary Combinatorial Topology

A Course in Convexity

4.2 Simplicial Homology Groups

Nowhere-Zero k-flows on Graphs

Monotone Paths in Geometric Triangulations

CHRISTOS A. ATHANASIADIS

arxiv: v4 [math.co] 30 Jun 2014

Combinatorial Aspects of Convex Polytopes

arxiv: v1 [math.co] 15 Dec 2009

Automorphism Groups of Cyclic Polytopes

Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams

Polyhedral Combinatorics of Coxeter Groups 2

60 2 Convex sets. {x a T x b} {x ã T x b}

Graph Theoretical Cluster Expansion Formulas

TORIC VARIETIES JOAQUÍN MORAGA

Computer Science 236 Fall Nov. 11, 2010

Mutation-linear algebra and universal geometric cluster algebras

Polytopes With Large Signature

ON CELLULAR RESOLUTION OF MONOMIAL IDEALS

A fan for every cluster algebra

CUBICAL SUBDIVISIONS AND LOCAL h-vectors

Lecture notes for Topology MMA100

1 Elementary number theory

Computable Euclidean Domains

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

2. Convex sets. x 1. x 2. affine set: contains the line through any two distinct points in the set

Shellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem

Lecture 0: Reivew of some basic material

MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:

A non-partitionable Cohen-Macaulay simplicial complex

MINIMAL FREE RESOLUTIONS OF COMPLETE BIPARTITE GRAPH IDEALS

UNIT-II NUMBER THEORY

Fano varieties and polytopes

Properties of Cut Polytopes

arxiv: v3 [math.co] 25 Jul 2016

Institutionen för matematik, KTH.

Lecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh

arxiv: v1 [math.co] 25 Sep 2015

Polytopes, Polynomials, and String Theory

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.

On Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract

2018 AIME I Problems

1. How many white tiles will be in Design 5 of the pattern? Explain your reasoning.

Chapter 4 Concepts from Geometry

A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES

ACO Comprehensive Exam March 19 and 20, Computability, Complexity and Algorithms

Module 7 Highlights. Mastered Reviewed. Sections ,

Transcription:

Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck & Serkan Hoşten San Francisco State University math.sfsu.edu/beck Math Research Letters

Growth Series of Lattices L R d lattice of rank r M subset that generates L as a monoid Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 2

Growth Series of Lattices L R d lattice of rank r M subset that generates L as a monoid S(n) number of elements in L with word length n (with respect to M) G(x) := n 0 S(n) xn growth series of (L, M) G(x) = h(x) (1 x) r where h is the coordinator polynomial of (L, M) Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 2

Growth Series of Lattices L R d lattice of rank r M subset that generates L as a monoid S(n) number of elements in L with word length n (with respect to M) G(x) := n 0 S(n) xn growth series of (L, M) G(x) = h(x) (1 x) r where h is the coordinator polynomial of (L, M) Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 2

Growth Series of Lattices L R d lattice of rank r M subset that generates L as a monoid S(n) number of elements in L with word length n (with respect to M) G(x) := n 0 S(n) xn growth series of (L, M) G(x) = h(x) (1 x) r where h is the coordinator polynomial of (L, M) Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 2

Cyclotomic Lattices L = Z[e 2πi/m ] = Z ϕ(m) M all m th roots of unity (suitably identified in R ϕ(m) ) h m coordinator polynomial of Z[e 2πi/m ] Initiated by Parker, motivated by error-correcting codes and random walks Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 3

Cyclotomic Lattices L = Z[e 2πi/m ] = Z ϕ(m) M all m th roots of unity (suitably identified in R ϕ(m) ) h m coordinator polynomial of Z[e 2πi/m ] Initiated by Parker, motivated by error-correcting codes and random walks Theorem (Kløve Parker) The coordinator polynomial of Z[e 2πi/p ], where p is prime, equals h p (x) = x p 1 + x p 2 + + 1. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 3

Cyclotomic Lattices L = Z[e 2πi/m ] = Z ϕ(m) M all m th roots of unity (suitably identified in R ϕ(m) ) h m coordinator polynomial of Z[e 2πi/m ] Initiated by Parker, motivated by error-correcting codes and random walks Theorem (Kløve Parker) The coordinator polynomial of Z[e 2πi/p ], where p is prime, equals h p (x) = x p 1 + x p 2 + + 1. Conjectures (Parker) (1) h m (x) = g(x) m m for a palindromic polynomial g of degree ϕ( m). (2) h 2p (x) = p 3 ( 2 k=0 x k + x p 1 k) k ( p ) j=0 j + 2 p 1 x p 1 2. (3) h 15 (x) = ( 1 + x 8) + 7 ( x + x 7) + 28 ( x 2 + x 6) + 79 ( x 3 + x 5) + 130x 4. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 3

Main Results Conjectures (Parker) (1) h m (x) = g(x) m m for a palindromic polynomial g of degree ϕ( m). (2) h 2p (x) = p 3 ( 2 k=0 x k + x p 1 k) k ( p j=0 j ) + 2 p 1 x p 1 2 (3) h 15 (x) = ( 1 + x 8) + 7 ( x + x 7) + 28 ( x 2 + x 6) + 79 ( x 3 + x 5) + 130x 4 Theorem (MB Hoşten) Suppose m is divisible by at most two odd primes. (1) h m (x) = h m(x) m m Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 4

Main Results Conjectures (Parker) (1) h m (x) = g(x) m m for a palindromic polynomial g of degree ϕ( m). (2) h 2p (x) = p 3 ( 2 k=0 x k + x p 1 k) k ( p j=0 j ) + 2 p 1 x p 1 2 (3) h 15 (x) = ( 1 + x 8) + 7 ( x + x 7) + 28 ( x 2 + x 6) + 79 ( x 3 + x 5) + 130x 4 Theorem (MB Hoşten) Suppose m is divisible by at most two odd primes. (1) h m (x) = h m(x) m m (2) h m(x) is the h-polynomial of a simplicial polytope. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 4

Main Results Conjectures (Parker) (1) h m (x) = g(x) m m for a palindromic polynomial g of degree ϕ( m). (2) h 2p (x) = p 3 ( 2 k=0 x k + x p 1 k) k ( p j=0 j ) + 2 p 1 x p 1 2 (3) h 15 (x) = ( 1 + x 8) + 7 ( x + x 7) + 28 ( x 2 + x 6) + 79 ( x 3 + x 5) + 130x 4 Theorem (MB Hoşten) Suppose m is divisible by at most two odd primes. (1) h m (x) = h m(x) m m (2) h m(x) is the h-polynomial of a simplicial polytope. Corollary If m is divisible by at most two odd primes, then h m(x) is palindromic, unimodal, and has nonnegative integer coefficients. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 4

Main Results Conjectures (Parker) (1) h m (x) = g(x) m m for a palindromic polynomial g of degree ϕ( m). ) + 2 p 1 x p 1 2 (2) h 2p (x) = p 3 ( 2 k=0 x k + x p 1 k) k ( p j=0 j (3) h 15 (x) = ( 1 + x 8) + 7 ( x + x 7) + 28 ( x 2 + x 6) + 79 ( x 3 + x 5) + 130x 4 Theorem (MB Hoşten) Suppose m is divisible by at most two odd primes. (1) h m (x) = h m(x) m m (2) h m(x) is the h-polynomial of a simplicial polytope. Corollary If m is divisible by at most two odd primes, then h m(x) is palindromic, unimodal, and has nonnegative integer coefficients. Theorem (MB Hoşten) Parker s Conjectures (2) & (3) are true. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 4

Cyclotomic Polytopes We choose a specific basis for Z[e 2πi/m ] consisting of certain powers of e 2πi/m which we then identify with the unit vectors in R ϕ(m). The other powers of e 2πi/m are integer linear combinations of this basis; hence they are lattice vectors in Z[e 2πi/m ] R ϕ(m). The m th cyclotomic polytope C m is the convex hull of all of these m lattice points in R ϕ(m), which correspond to the m th roots of unity. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 5

Cyclotomic Polytopes We choose a specific basis for Z[e 2πi/m ] consisting of certain powers of e 2πi/m which we then identify with the unit vectors in R ϕ(m). The other powers of e 2πi/m are integer linear combinations of this basis; hence they are lattice vectors in Z[e 2πi/m ] R ϕ(m). The m th cyclotomic polytope C m is the convex hull of all of these m lattice points in R ϕ(m), which correspond to the m th roots of unity. We will do this recursively in three steps: (1) m is prime (2) m is a prime power (3) m is the product of two coprime integers. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 5

Cyclotomic Polytopes We choose a specific basis for Z[e 2πi/m ] consisting of certain powers of e 2πi/m which we then identify with the unit vectors in R ϕ(m). The other powers of e 2πi/m are integer linear combinations of this basis; hence they are lattice vectors in Z[e 2πi/m ] R ϕ(m). The m th cyclotomic polytope C m is the convex hull of all of these m lattice points in R ϕ(m), which correspond to the m th roots of unity. We will do this recursively in three steps: (1) m is prime (2) m is a prime power (3) m is the product of two coprime integers. When m = p is a prime number, let ζ = e 2πi/p and fix the Z -basis 1, ζ, ζ 2,..., ζ p 2 of the lattice Z[ζ]. Together with ζ p 1 = p 2 j=0 ζj, these p elements form a monoid basis for Z[ζ]. We identify them with e 0, e 1,..., e p 2, p 2 j=0 e j in R p 1 and define the cyclotomic polytope C p R p 1 as the simplex ( C p = conv e 0, e 1,..., e p 2, p 2 i=0 e i ). Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 5

C p = conv Cyclotomic Polytopes ( e 0, e 1,..., e p 2, p 2 i=0 e i ). C 3 Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 6

C p = conv Cyclotomic Polytopes ( e 0, e 1,..., e p 2, p 2 i=0 e i ). C 3 Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 6

Cyclotomic Polytopes For two polytopes P R d 1 and Q R d 2, each containing the origin in its interior, we define the direct sum P Q := conv (P 0 d2, 0 d1 Q). For a prime p, we define the cyclotomic polytope C p α = C p C p C p }{{} p α 1 times. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 7

Cyclotomic Polytopes For two polytopes P R d 1 and Q R d 2, each containing the origin in its interior, we define the direct sum P Q := conv (P 0 d2, 0 d1 Q). For a prime p, we define the cyclotomic polytope C p α = C p C p C p }{{} p α 1 times. C 4 Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 7

Cyclotomic Polytopes For two polytopes P R d 1 and Q R d 2, each containing the origin in its interior, we define the direct sum P Q := conv (P 0 d2, 0 d1 Q). For a prime p, we define the cyclotomic polytope C p α = C p C p C p }{{} p α 1 times. C 4 Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 7

Cyclotomic Polytopes For two polytopes P R d 1 and Q R d 2, each containing the origin in its interior, we define the direct sum P Q := conv (P 0 d2, 0 d1 Q). For a prime p, we define the cyclotomic polytope C p α = C p C p C p }{{} p α 1 times For two polytopes P = conv (v 1, v 2..., v s ) and Q = conv (w 1, w 2,..., w t ) we define their tensor product P Q := conv (v i w j : 1 i s, 1 j t).. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 7

Cyclotomic Polytopes For two polytopes P R d 1 and Q R d 2, each containing the origin in its interior, we define the direct sum P Q := conv (P 0 d2, 0 d1 Q). For a prime p, we define the cyclotomic polytope C p α = C p C p C p }{{} p α 1 times For two polytopes P = conv (v 1, v 2..., v s ) and Q = conv (w 1, w 2,..., w t ) we define their tensor product P Q := conv (v i w j : 1 i s, 1 j t). Our construction implies for m = m 1 m 2, where m 1, m 2 > 1 are relatively prime, that the cyclotomic polytope C m is equal to C m1 C m2.. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 7

Cyclotomic Polytopes For two polytopes P R d 1 and Q R d 2, each containing the origin in its interior, we define the direct sum P Q := conv (P 0 d2, 0 d1 Q). For a prime p, we define the cyclotomic polytope C p α = C p C p C }{{} p. p α 1 times For two polytopes P = conv (v 1, v 2..., v s ) and Q = conv (w 1, w 2,..., w t ) we define their tensor product P Q := conv (v i w j : 1 i s, 1 j t). Our construction implies for m = m 1 m 2, where m 1, m 2 > 1 are relatively prime, that the cyclotomic polytope C m is equal to C m1 C m2. For general m, C m = C m C m C m, }{{} m times m a 0/ ± 1 polytope with the origin as the sole interior lattice point. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 7

Hilbert Series L = Z d a lattice, M a minimal set of monoid generators, K a field The vectors in M = {(u, 1) : u M {0}} encoded as monomials give rise to the monoid algebra K[M ], in which each monomial corresponds to (v, k) where v = u i M {0} n iu i with nonnegative integer coefficients n i such that n i = k. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 8

Hilbert Series L = Z d a lattice, M a minimal set of monoid generators, K a field The vectors in M = {(u, 1) : u M {0}} encoded as monomials give rise to the monoid algebra K[M ], in which each monomial corresponds to (v, k) where v = u i M {0} n iu i with nonnegative integer coefficients n i such that n i = k. This grading gives rise to the Hilbert series H(K[M ]; x) := k 0 dim K (K[M ] k ) x k, where K[M ] k denotes the vector space of elements of degree k in this graded algebra. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 8

Hilbert Series L = Z d a lattice, M a minimal set of monoid generators, K a field The vectors in M = {(u, 1) : u M {0}} encoded as monomials give rise to the monoid algebra K[M ], in which each monomial corresponds to (v, k) where v = u i M {0} n iu i with nonnegative integer coefficients n i such that n i = k. This grading gives rise to the Hilbert series H(K[M ]; x) := k 0 dim K (K[M ] k ) x k = h(x) (1 x) d+1, where K[M ] k denotes the vector space of elements of degree k in this graded algebra. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 8

Hilbert Series L = Z d a lattice, M a minimal set of monoid generators, K a field The vectors in M = {(u, 1) : u M {0}} encoded as monomials give rise to the monoid algebra K[M ], in which each monomial corresponds to (v, k) where v = u i M {0} n iu i with nonnegative integer coefficients n i such that n i = k. This grading gives rise to the Hilbert series H(K[M ]; x) := k 0 dim K (K[M ] k ) x k = h(x) (1 x) d+1, where K[M ] k denotes the vector space of elements of degree k in this graded algebra. When L = Z d, the number of elements in L of length k (with respect to M ) is equal to dim K (K[M ] k ) dim K (K[M ] k 1 ), and therefore the growth series of L is G(x) = (1 x)h(k[m ]; x) = h(x) (1 x) d. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 8

Hilbert Series L = Z d a lattice, M a minimal set of monoid generators, K a field The vectors in M = {(u, 1) : u M {0}} encoded as monomials give rise to the monoid algebra K[M ], in which each monomial corresponds to (v, k) where v = u i M {0} n iu i with nonnegative integer coefficients n i such that n i = k. This grading gives rise to the Hilbert series H(K[M ]; x) := k 0 dim K (K[M ] k ) x k = h(x) (1 x) d+1, where K[M ] k denotes the vector space of elements of degree k in this graded algebra. When L = Z d, the number of elements in L of length k (with respect to M ) is equal to dim K (K[M ] k ) dim K (K[M ] k 1 ), and therefore the growth series of L is G(x) = (1 x)h(k[m ]; x) = h(x) (1 x) d. In the conditions of our theorem, the Hilbert series of C m C m equals (1 x) times the square of the Hilbert series of C m, whence h m (x) = h m(x) m m. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 8

Total Unimodularity and Normality A polytope P is totally unimodular if every submatrix of the matrix consisting of the vertices of P has determinant 0, ±1. Theorem (MB Hoşten) If m is divisible by at most two odd primes then the cyclotomic polytope C m is totally unimodular. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 9

Total Unimodularity and Normality A polytope P is totally unimodular if every submatrix of the matrix consisting of the vertices of P has determinant 0, ±1. Theorem (MB Hoşten) If m is divisible by at most two odd primes then the cyclotomic polytope C m is totally unimodular. Corollary If m is divisible by at most two odd primes then the cyclotomic polytope C m is normal, i.e., the monoid generated by M and the monoid of the lattice points in the cone generated by M are equal. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 9

Total Unimodularity and Normality A polytope P is totally unimodular if every submatrix of the matrix consisting of the vertices of P has determinant 0, ±1. Theorem (MB Hoşten) If m is divisible by at most two odd primes then the cyclotomic polytope C m is totally unimodular. Corollary If m is divisible by at most two odd primes then the cyclotomic polytope C m is normal, i.e., the monoid generated by M and the monoid of the lattice points in the cone generated by M are equal. Remark Total unimodularity breaks down already for C 3pq for distinct primes p, q > 3. This is an indication that Parker s Conjecture (1) might not be true in general. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 9

Total Unimodularity and Normality Theorem (MB Hoşten) Suppose m is divisible by at most two odd primes. (2) h m(x) is the h-polynomial of a simplicial polytope.... follows now because C m has a unimodular triangulation, which induces a unimodular triangulation of the boundary of C m. This boundary equals the boundary of a simplicial polytope Q (Stanley), and h m is the h- polynomial of Q (which is palindromic, unimodal, and nonnegative). Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 10

Total Unimodularity and Normality Theorem (MB Hoşten) Suppose m is divisible by at most two odd primes. (2) h m(x) is the h-polynomial of a simplicial polytope.... follows now because C m has a unimodular triangulation, which induces a unimodular triangulation of the boundary of C m. This boundary equals the boundary of a simplicial polytope Q (Stanley), and h m is the h- polynomial of Q (which is palindromic, unimodal, and nonnegative). Remark If C m is a simplicial polytope then the coordinator polynomial h m equals the h-polynomial of C m. The polytope C m is simplicial, e.g., for m a prime power or the product of two primes (the latter was proved by R. Chapman and follows from the fact that C pq is dual to a transportation polytope with margins p and q). Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 10

Open Problems Describe the face structure of C m, e.g., in the case m = pq. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 11

Open Problems Describe the face structure of C m, e.g., in the case m = pq. Is C m normal for all m? Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 11

Open Problems Describe the face structure of C m, e.g., in the case m = pq. Is C m normal for all m? S. Sullivant computed that the dual of C 105 is not a lattice polytope, i.e., C 105 is not reflexive. If we knew that C 105 is normal, a theorem of Hibi would imply that the coordinator polynomial h 105 is not palindromic, and hence that Parker s Conjecture (1) is not true in general. Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck 11