Overview
- What is the Ehrhart polynomial of a lattice polytope?
- How do simple polytopes give different Galois groups?
- Which finite groups can occur?
Definition and example
For a lattice polytope , the function , for integers , is a polynomial in of degree . Its constant term is .
For , coordinate counting gives . Its splitting field is , and its Galois group is trivial. Ehrhart polynomials need not be irreducible or squarefree.
References 1
- FiekerHofmannJoswig2022 · §1; §3, Example 2Source
Example
For the standard simplex , lattice points in its -th dilate are nonnegative integer vectors with sum at most . Counting them gives
Thus the polynomial splits over . This follows directly from the lattice-point count.
For the different simplex , Fieker–Hofmann–Joswig give
In dimension two this is , with discriminant . Its group is . Their Theorem 4 describes the group for this family in every dimension.
References 1
- FiekerHofmannJoswig2022 · §3, Example 3 and Theorem 4Source
Computing the group
Fieker–Hofmann–Joswig apply subgroup descent in OSCAR to Ehrhart polynomials. They combine permutation groups, relative invariants, and certified root approximations. Their software comparisons concern the 2022 versions.
References 1
Questions
Which finite groups occur for Ehrhart polynomials?
Scope. Splitting fields of Ehrhart polynomials of arbitrary lattice polytopes over Q
Question 6 asks which groups occur, and specifically whether every finite cyclic group occurs. No irreducibility assumption is imposed. The question restricts inverse Galois theory to polynomials arising from lattice-point counts.
References 1
- FiekerHofmannJoswig2022 · §4, Question 6, p. 7 of the published versionSource
Related topics
References
- Computing Galois Groups of Ehrhart Polynomials in OSCAR
Fieker, Claus and Hofmann, Tommy and Joswig, Michael. Séminaire Lotharingien de Combinatoire, 86B, Article 87, 1–9, 2022.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.