Related papers: From Polynomials to Databases: Arithmetic Structur…

This paper presents a neurosymbolic approach to classifying Galois groups of polynomials, integrating classical Galois theory with machine learning to address challenges in algebraic computation. By combining neural networks with symbolic…

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…

The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…

We establish several surjectivity theorems regarding the Galois groups of small iterates of $\phi_c(x)=x^2+c$ for $c\in\mathbb{Q}$. To do this, we use explicit techniques from the theory of rational points on curves, including the method of…

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…

We report on a database of field extensions of the rationals, its properties and the methods used to compute it. At the moment the database encompasses roughly 100,000 polynomials generating distinct number fields over the rationals, of…

Let $f(x)=x^8+ax^4+b \in \mathbb{Q}[x]$ be an irreducible polynomial where $b$ is a square. We give a method that completely describes the factorization patterns of a linear resolvent of $f(x)$ using simple arithmetic conditions on $a$ and…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

We prove that the transitive permutation group 17T7, isomorphic to a split extension of $C_2$ by $\mathrm{PSL}_2(\mathbb{F}_{16})$, is a Galois group over the rationals. The group arises from the field of definition of the $2$-torsion on an…

For each of the groups PSL2(F25), PSL2(F32), PSL2(F49), PGL2(F25), and PGL2(F27), we display the first explicitly known polynomials over Q having that group as Galois group. Each polynomial is related to a Galois representation associated…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

This article studies the Galois groups that arise from division points of the lemniscate. We compute these Galois groups two ways: first, by class field theory, and second, by proving the irreducibility of lemnatomic polynomials, which are…

By applying interpretable machine learning methods such as decision trees, we study how simple models can classify the Galois groups of Galois extensions over $\mathbb{Q}$ of degrees 4, 6, 8, 9, and 10, using Dedekind zeta coefficients. Our…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…

We develop the representation theory for reductive linear differential algebraic groups (LDAGs). In particular, we exhibit an explicit sharp upper bound for orders of derivatives in differential representations of reductive LDAGs, extending…

For prime $p$ and small $n$, Jones and Roberts have developed a database recording invariants for $p$-adic extensions of degree $n$. We contributed to this database by computing the Galois slope content, Galois mean slope, and inertia…

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…