Computing Galois groups of Ehrhart polynomials in OSCAR (Q6103866)

The paper under review reports on an implementation of the task of computing Galois groups of rational polynomials in the computer algebra system \texttt{OSCAR}. The authors show how \texttt{OSCAR} can be used to study the Galois groups of \textit{Ehrhart polynomials}, which arise as follows. Let \(P\) be a \(d\)-dimensional lattice polytope in \(\mathbf{R}^d\), i.e., the convex hull of finitely many points in \(\mathbf{Z}^d\). The lattice-point counting function \[ \mathrm{ehr}_P(t) \ := \ \# \left( tP \cap\mathbf{Z}^d \right) \] is a polynomial in the positive integer variable \(t\), by Ehrhart's fundamental theorem [\textit{E. Ehrhart}, C. R. Acad. Sci., Paris 254, 616--618 (1962; Zbl 0100.27601)]. The classification of Ehrhart polynomials (i.e., the question \textit{which polynomials arise as Ehrhart polynomials?}) is open in dimension \(\ge 3\). The authors suggest the alternative question \textit{which groups arise as Galois groups of Ehrhart polynomials?} They report on computations for the class of smooth Fano polytopes, illustrating that the above question is interesting also for subclasses of lattice polytopes.