Related papers: Hrushovski's Algorithm for Computing the Galois Gr…
Graded-division algebras are building blocks in the theory of finite-dimensional associative algebras graded by a group G. If G is abelian, they can be described, using a loop construction, in terms of central simple graded-division…
In a previous article (a joint work with J. Manoharmayum) the modularity of a large class of rigid Calabi-Yau threefolds was established. To make that result more explicit, we recall (and re-prove) a result of Serre giving a bound for the…
In this survey we present the parameterized Galois theory of difference equations, as introduced by Hardouin-Singer. The purpose of this theory is to give a systematic approach to differential transcendence, also called hypertranscendence.…
The present paper essentially contains two results that generalize and improve some of the constructions of [arXiv:0801.1493]. First of all, in the case of one derivation, we prove that the parameterized Galois theory for difference…
We develop general criteria that ensure that any non-zero solution of a given second-order difference equation is differentially transcendental, which apply uniformly in particular cases of interest, such as shift difference equations,…
In 1980, Odoni initiated the study of the fixed-point proportion of iterated Galois groups of polynomials motivated by prime density problems in arithmetic dynamics. The main goal of the present paper is to completely settle the…
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and…
We describe a project to formalize Galois theory using the Lean theorem prover, which is part of a larger effort to formalize all of the standard undergraduate mathematics curriculum in Lean. We discuss some of the challenges we faced and…
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…
In this paper a Galoisian approach to build propagators through Riccati equations is presented. The main result corresponds to the relationship between the Galois integrability of the linear Schr\"odinger equation and the virtual…
This is a revision of the paper that was previously entitled "Weighted Completion of Galois Groups and Some Conjectures of Deligne". Fix a prime number $\l$. We prove a conjecture stated by Ihara, which he attributes to Deligne, about the…
A classical result of F.Klein states that, given a finite primitive group $G\subseteq SL_2(\mathbb{C})$, there exists a hypergeometric equation such that any second order LODE whose differential Galois group is isomorphic to $G$ is…
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 present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…
We classify Schubert problems in the Grassmannian of 4-planes in 9-dimensional space by their Galois groups. Of the 31,806 essential Schubert problems in this Grassmannian, there are only 149 whose Galois group does not contain the…
We study a necessary condition for the integrability of the polynomials fields in the plane by means of the differential Galois theory. More concretely, by means of the variational equations around a particular solution it is obtained 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…
In this paper, we propose algorithms to compute differential Chow forms for prime differential ideals which are given by their characteristic sets. The main algorithm is based on an optimal bound for the order of a prime differential ideal…
Many different programs are the implementation of the same algorithm. The collection of programs can be partitioned into different classes corresponding to the algorithms they implement. This makes the collection of algorithms a quotient of…
Using the group theoretic method of spectrum generating algebras a class of differential equations is obtained whose eigenvalues are calculated without explicitly solving the equations. Solutions can be easily obtained by group theoretic…