Related papers: Constructions using Galois Theory

We develop a Galois theory for linear differential equations equipped with the action of an endomorphism. This theory is aimed at studying the difference algebraic relations among the solutions of a linear differential equation. The Galois…

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…

We develop a computational framework for classifying Galois groups of irreducible degree-7 polynomials over~$\mathbb{Q}$, combining explicit resolvent methods with machine learning techniques. A database of over one million normalized…

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 compute the asymptotic number of monic trace-one integral polynomials with Galois group $C_3$ and bounded height. For such polynomials we compute a height function coming from toric geometry and introduce a parametrization using the…

In this preprint we present an outline of the multidimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvability by radicals, by…

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…

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…

In this paper, we construct, for some $2$-groups $G$, explicit Galois extensions $E/\mathbb{Q}(T)$ of group $G$ with $E\cap\overline{\mathbb{Q}}=\mathbb{Q}$. We also provide explicit arithmetic progressions of integers $t_0$ such that the…

We study the Galois-module structure of polydifferentials for Mumford curves, defined over a field of positive charactersitic, using the theory of harmonic cocycles. For the case of Artin-Schreier-Mumford curves the structure of holomorphic…

In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…

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 compute the Galois group of the maximal 2-ramified and complexified pro-2-extension of any 2-rational number field.

We introduce a criterion on the presentation of finitely presented pro-$p$ groups which allows us to compute their cohomology groups and infer quotients of mild groups of cohomological dimension strictly larger than two, from (non-free)…

For a differential field $F$ having an algebraically closed field of constants, we analyze the structure of Picard-Vessiot extensions of $F$ whose differential Galois groups are unipotent algebraic groups and apply these results to study…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

For finite Galois extension fields defined by odd degree irreducible polynomials over algebraic integer ring, we observe "Reciprocity Law" through Jacobian Variety by embedding all roots of the polynomials into 2-torsion points of Jacobian…

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…