Related papers: Numerical computation of Galois groups

A lot of work has gone into computing images of Galois representations coming from elliptic curves. This article presents an algorithm to determine the image of the mod-$3$ Galois representation associated to a principally polarized abelian…

There is a connection between permutation groups and permutation patterns: for any subgroup $G$ of the symmetric group $S_\ell$ and for any $n \geq \ell$, the set of $n$-permutations involving only members of $G$ as $\ell$-patterns is a…

Two Schubert problems on possibly different Grassmannians may be composed to obtain a Schubert problem on a larger Grassmannian whose number of solutions is the product of the numbers of the original problems. This generalizes a…

We give conditions for the monodromy group of a Hurwitz space over the configuration space of branch points to be the full alternating or symmetric group on the degree. Specializing the resulting coverings suggests the existence of many…

We introduce and develop a structure theory of a new class of noncommutative rings - Galois orders, that generalize classical orders in noncommutative rings. Galois orders realized as certain subrings of invariants in skew semigroup rings.…

In this article, we realize some groups as Galois groups over rational numbers and finite extension of rational numbers by studying right splitting of some exact sequences, Galois correspondence and algebraic operations on Galois…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

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…

Let $p$ be prime, and $n,m \in \mathbb{N}$. When $K/F$ is a cyclic extension of degree $p^n$, we determine the $\mathbb{Z}/p^m\mathbb{Z}[\text{Gal}(K/F)]$-module structure of $K^\times/K^{\times p^m}$. With at most one exception, each…

We study the arithmetic and geometric iterated monodromy groups associated to the postcritically finite (PCF) quadratic rational function $f(x)=\frac{2}{(x-1)^2}$ defined over a number field $k$, whose critical points are both strictly…

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.

I discuss a seemingly unlikely confluence of topics in algebra, numerical computation, and computer vision. The motivating problem is that of solving multiples instances of a parametric family of systems of algebraic (polynomial or rational…

The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…

Let $f:X\to Y$ be a finite ramified Galois covering of algebraic varieties defined over the complex numbers. In this paper, we prove some structure theorems for such coverings in the case that the non-abelian Galois group of the cover is…

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…

We present a detailed and simplified version of Hrushovski's algorithm that determines the Galois group of a linear differential equation. There are three major ingredients in this algorithm. The first is to look for a degree bound for…

A strategy to address the inverse Galois problem over Q consists of exploiting the knowledge of Galois representations attached to certain automorphic forms. More precisely, if such forms are carefully chosen, they provide compatible…

We develop a computational framework for the statistical characterization of Galois characters with finite image, with application to characterizing Galois groups and establishing equivalence of characters of finite images of…

This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…

This article computes the Galois groups of congruence covers arising in the context of certain hyperbolic triangle groups. As a consequence of this computation, the genera of the respective curves are deduced.