相关论文: Computation of Galois groups of rational polynomia…

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 apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…

Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

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…

We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by 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…

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…

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…

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…

Let G be a linear algebraic group, not necessarily connected or reductive, over the field of real numbers R. We describe a method, implemented on computer, to find the first Galois cohomology set H^1(R,G). The output is a list of 1-cocycles…

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…

For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…

We develop algorithms to compute the differential Galois group $G$ associated to a parameterized second-order homogeneous linear differential equation of the form \[ \tfrac{\partial^2}{\partial x^2} Y + r_1 \tfrac{\partial}{\partial x} Y +…

We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…

For a differential operator $L$ of order $n$ over $C(z)$ with a finite (differential) Galois group $G\subset {\rm GL}(C^n)$, there is an algorithm, by M. van Hoeij and J.-A.~Weil, which computes the associated evaluation of the invariants…

The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski's algorithm for computing the Galois group of a linear differential…

In this work we compute the families of classical Hamiltonians in two degrees of freedom in which the Normal Variational Equation around an invariant plane falls in Schroedinger type with polynomial or trigonometrical potential. We analyze…

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…