Computing Galois groups of Ehrhart polynomials in OSCAR

zbMath1523.12001arXiv2203.10287MaRDI QIDQ6103866

Tommy Hofmann, Claus Fieker, Michael Joswig

Publication date: 5 June 2023

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.10287

zbMATH Keywords

computer algebralattice polytopessmooth Fano polytopesOpen Source Computer Algebra Resource (OSCAR)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Separable extensions, Galois theory (12F10) Computational methods for problems pertaining to field theory (12-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• polyDB: A Database for Polytopes and Related Objects
• Smooth Fano polytopes with many vertices
• The computation of generalized Ehrhart series in normaliz
• Improved methods for the construction of relative invariants for permutation groups
• Roots of Ehrhart polynomials of smooth Fano polytopes
• Integer points in polyhedra
• Computing Galois groups over the rationals
• The Magma algebra system. I: The user language
• Ehrhart polynomial roots of reflexive polytopes
• Notes on the roots of Ehrhart polynomials
• Computing convex hulls and counting integer points with \texttt{polymake}
• On the Complexity of Computing the Volume of a Polyhedron
• The Determination of Galois Groups
• Nemo/Hecke
• Computation of Galois groups of rational polynomials
• Computing the Continuous Discretely