Related papers: Galois theory by calculator

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…

In this paper, we consider integral and irreducible binary quartic forms whose Galois group is isomorphic to a subgroup of the dihedral group of order eight. We first show that the set of all such forms is a union of families indexed by…

We extend several predecessor works on even sextic monogenic polynomials. In particular, we prove a conjecture of Lenny Jones, thereby classifying even sextic monogenic polynomials with cyclic Galois group. This result is key to completing…

We study origami $f: C \rightarrow E$ with $G$-Galois cover $Q_8$. For a point $P \in E(\mathbb{Q}) \backslash \left\{ \mathcal{O} \right\}$, we study the field obtained by adjoining to $\mathbb{Q}$ the coordinates of all of the preimages…

We prove that the arboreal Galois representations attached to certain unicritical polynomials have finite index in an infinite wreath product of cyclic groups, and we prove surjectivity for some small degree examples, including a new family…

We prove that the number of unimodular integral matrices in a norm ball whose characteristic polynomial has Galois group different than the full symmetric group is of strictly lower order of magnitude than the number of all such matrices in…

Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.

We show how the output of the algorithm to compute modular Galois representations described in our previous article can be certified. We have used this process to compute certified tables of such Galois representations obtained thanks to an…

Let K be a number field and let f(x) = x^q + c where q is a prime power, c is in K, and f is not post-critically finite. We show that for any strictly preperiodic b in K, the iterated Galois group at b with respect to f has finite index in…

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

In this article we compute Galois groupoid of discret Painlev{\'e} equations. Our main tool is a semi-continuity theorem for the Galois groupoid in a confluence situation of a diffrence equation to a differential equation.

Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…

Let $G$ be a subgroup of the symmetric group $S_n$, and let $\delta_G=|S_n/G|^{-1}$ where $|S_n/G|$ is the index of $G$ in $S_n$. Then there are at most $O_{n, \epsilon}(H^{n-1+\delta_G+\epsilon})$ monic integer polynomials of degree $n$…

The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…

In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

Given a Mersenne prime $q$ and a positive even integer $e$, let $F$ and $E$ be the fields of orders $q$ and $q^e$ respectively. Let $C$ be a cyclic subgroup of $E^\times$ whose index in $E^\times$ is divisible only by primes dividing $q -…

We extend our method to compute division polynomials of Jacobians of curves over Q to curves over Q(t), in view of computing mod ell Galois representations occurring in the \'etale cohomology of surfaces over Q. Although the division…