Computing Galois groups of Ehrhart polynomials in OSCAR
Claus Fieker, Tommy Hofmann, Michael Joswig
TL;DR
This paper presents an implementation of Galois group computations within OSCAR, applied to Ehrhart polynomials of lattice polytopes, demonstrating the system's capabilities in algebraic computations.
Contribution
The paper introduces a new implementation of Galois group calculations in OSCAR, specifically applied to Ehrhart polynomials, showcasing its practical utility.
Findings
Successful computation of Galois groups for Ehrhart polynomials
Demonstration of OSCAR's capabilities in algebraic computations
Potential for further applications in polytope analysis
Abstract
We report on an implementation of Galois groups in the new computer algebra system OSCAR. As an application we compute Galois groups of Ehrhart polynomials of lattice polytope
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic Geometry and Number Theory · Polynomial and algebraic computation