Permuting the roots of univariate polynomials whose coefficients depend on parameters

Let $\mathcal{C}_d\subset \mathbb{C}^{d+1}$ be the space of non-singular, univariate polynomials of degree $d$. The Vi\`{e}te map $\mathscr{V} : \mathcal{C}_d \rightarrow Sym_d(\mathbb{C})$ sends a polynomial to its unordered set of roots. It is a classical fact that the induced map $\mathscr{V}_*$ at the level of fundamental groups realises an isomorphism between $\pi_1(\mathcal{C}_d)$ and the Artin braid group $B_d$. For fewnomials, or equivalently for the intersection $\ma...

Let $C \langle t_1, \dots t_l\rangle$ be the differential field generated by $l$ differential indeterminates $\boldsymbol{t}=(t_1, \dots ,t_l)$ over an algebraically closed field $C$ of characteristic zero. We develop a lower bound criterion for the differential Galois group $G(C)$ of a matrix parameter differential equation $\partial(\boldsymbol{y})=A(\boldsymbol{t})\boldsymbol{y}$ over $C \langle t_1, \dots t_l\rangle$ and we prove that every connected linear algebraic grou...

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial, proving it for arbitrary tame polynomials, and considering the case of rational functions.

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 + r_0 Y = 0, \] where the coefficients $r_1, r_0 \in F(x)$ are rational functions in $x$ with coefficients in a partial differential field $F$ of characteristic zero. Our work relies on the procedure developed by Dreyfus to compute $G$ under ...

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 group G_f of a rational function f in K(x).

We study the problem of existence of one-parameter, linear families of polynomials of degree n all of whose polynomials have Galois group A_n. The methods we use have a strong geometric flavour.

This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks. It is shown that several problems relating to their structure and dynamics, as well as control theory, can be formulated and solved in the language of algebraic geometry.

The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the representation theory of linear differential algebraic groups and develop new algorithms that calculate unipotent radicals of parameterized differential Galois groups for differential equations whose coefficients are rational functions. P. Berman...

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields satisfying certain conditions on cohomology. In particular, we use our techniques to study constructions for unipotent groups, certain algebraic tori, and certain split semisimple groups. An attractive consequence of our work is the constru...

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 groups of all totally ramified extensions of $\mathbb{Q}_2$ of degrees 18, 20 and 22, tables of which are available online.