Related papers: Computing subfields of number fields and applicati…

We present a method for computing complete lists of number fields in cases where the Galois group, as an abstract group, appears as a Galois group in smaller degree. We apply this method to find the twenty-five octic fields with Galois…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

A main problem in Galois theory is to characterize the fields with a given absolute Galois group. We apply a K-theoretic method for constructing valuations to study this problem in various situations. As a first application we obtain an…

We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…

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…

We propose an approach for the computation of multi-parameter families of Galois extensions with prescribed ramification type. More precisely, we combine existing deformation and interpolation techniques with recently developed strong tools…

This note presents Galois theory for finite fields. It was written as a handout for the MAT401 course ``Polynomial equations and fields'' taught at the University of Toronto in Spring 2026. We use without proofs some basic properties of…

In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

For each finite subgroup $G$ of $PGL_2(\mathbb{Q})$, and for each integer $n$ coprime to $6$, we construct explicitly infinitely many Galois extensions of $\mathbb{Q}$ with group $G$ and whose ideal class group has $n$-rank at least…

The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…

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…

Born from years of teaching undergraduate and graduate algebra courses at Chongqing University, this text is designed to introduce Galois theory while minimizing prerequisites. It seeks to reconnect the abstract machinery of modern algeba:…

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

For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…

Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…

We introduce an abstract topos-theoretic framework for building Galois-type theories in a variety of different mathematical contexts; such theories are obtained from representations of certain atomic two-valued toposes as toposes of…

Field Arithmetic studies the interplay between arithmetical properties of fields and their absolute Galois groups. Here we studies fields satisfying local global principles for rational points of varieties and profinite groups satisfying…