Related papers: Numerical computation of Galois groups

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

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…

We develop algorithms to compute the differential Galois group corresponding to a one-parameter family of second order homogeneous ordinary linear differential equations with rational function coefficients. More precisely, we consider…

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 create plots of algebraic integers in the complex plane, exploring the effect of sizing the integers according to various arithmetic invariants. We focus on Galois theoretic invariants, in particular creating plots which emphasize…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

As Jordan observed in 1870, just as univariate polynomials have Galois groups, so do problems in enumerative geometry. Despite this pedigree, the study of Galois groups in enumerative geometry was dormant for a century, with a systematic…

We consider a large class of so-called dynamical Belyi maps and study the Galois groups of iterates of such maps. From the combinatorial invariants of the maps, we construct a useful presentation of their Galois groups as subgroups of…

Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…

The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

The Galois group of a Schubert problem encodes some structure of its set of solutions. Galois groups are known for a few infinite families and some special problems, but what permutation groups may appear as a Galois group of a Schubert…

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

In the first part of this paper we try to explain to a general mathematical audience some of the remarkable web of conjectures linking representations of Galois groups with algebraic geometry, complex analysis and discrete subgroups of Lie…

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…

We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…

We study the interplay between the differential Galois group and the Lie algebra of infinitesimal symmetries of systems of linear differential equations. We show that some symmetries can be seen as solutions of a hierarchy of linear…

Fix a degree $d$ projective curve $X \subset \mathbb{P}^r$ over an algebraically closed field $K$. Let $U \subset (\mathbb{P}^r)^*$ be a dense open subvariety such that every hyperplane $H \in U$ intersects $X$ in $d$ smooth points. Varying…

We present a simple method for the construction of polynomials with cyclic Galois groups, hoping to encourage a reader with some background in algebra to make computations of his/her own.

For every number field and every Cartan Killing type, there is an associated split simple algebraic group. We examine whether the corresponding arithmetic subgroups are profinitely solitary so that the commensurability class of the…