English
Related papers

Related papers: Computing Galois groups of Ehrhart polynomials in …

200 papers

OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…

Group Theory · Mathematics 2024-04-15 Claus Fieker , Max Horn

OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…

Combinatorics · Mathematics 2024-04-04 Taylor Brysiewicz , Michael Joswig

We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…

Combinatorics · Mathematics 2026-01-06 Enrique Reyes , Carlos E. Valencia , Rafael H. Villarreal

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

Number Theory · Mathematics 2020-03-13 Christopher Doris

OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…

Combinatorics · Mathematics 2025-05-21 Daniel Corey , Lukas Kühne , Benjamin Schröter

We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.

Symbolic Computation · Computer Science 2015-03-10 Ruyong Feng

In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…

Symbolic Computation · Computer Science 2009-04-27 Annick Valibouze

We introduce the AlgebraicStatistics section of the OSCAR computer algebra system. We give an overview of its extensible design and highlight its features including serialization of data types for sharing results and creating databases, and…

Computation · Statistics 2026-01-23 Tobias Boege , Antony Della Vecchia , Marina Garrote-López , Benjamin Hollering

We compute the first explicit polynomials with Galois groups $G=P\Gamma L_3(4)$, $PGL_3(4)$, $PSL_3(4)$ and $PSL_5(2)$ over $\mathbb{Q}(t)$. Furthermore we compute the first examples of totally real polynomials with Galois groups…

Number Theory · Mathematics 2015-12-18 Joachim König

In this survey, we present a detailed guide on using the computer algebra system OSCAR to compute monomial bases for simple, finite-dimensional modules of simple, complex Lie algebras. We will also demonstrate how to determine monomial…

Representation Theory · Mathematics 2024-03-25 Xin Fang , Ghislain Fourier , Lars Göttgens , Ben Wilop

In this paper we compute the Galois groups of basic hypergeometric equations.

Classical Analysis and ODEs · Mathematics 2007-09-21 Julien Roques

We give a brief introduction to computational algebraic number theory in OSCAR. Our main focus is on number fields, rings of integers and their invariants. After recalling some classical results and their constructive counterparts, we…

Number Theory · Mathematics 2024-04-11 Claus Fieker , Tommy Hofmann

We show how the computer algebra system OSCAR can be used to obtain topologically correct or visually pleasing drawings of real plane algebraic curves.

Algebraic Geometry · Mathematics 2026-03-16 Anne Frühbis-Krüger , Michael Joswig , Lars Kastner

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…

Combinatorics · Mathematics 2025-05-21 Taylor Brysiewicz , Holger Eble , Lukas Kühne

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

Number Theory · Mathematics 2019-02-20 Claus Fieker , Jürgen Klüners

We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…

Combinatorics · Mathematics 2023-03-31 Wayne A. Johnson

This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…

Machine Learning · Computer Science 2025-01-23 Elira Shaska , Tony Shaska

We extend Kovacic's algorithm to compute the differential Galois group of some second order parameterized linear differential equation. In the case where no Liouvillian solutions could be found, we give a necessary and sufficient condition…

Classical Analysis and ODEs · Mathematics 2019-02-22 Thomas Dreyfus

In this article we present a new method to obtain polynomial lower bounds for Galois orbits of torsion points of one dimensional group varieties.

Number Theory · Mathematics 2019-02-21 Harry Schmidt

We apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…

Number Theory · Mathematics 2025-03-21 Carlos E. Arreche , Yi Zhang
‹ Prev 1 2 3 10 Next ›