Related papers: Solving Parameterized Polynomial Systems with Deco…
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
We show how rational points on certain varieties parametrize phenomena arising in the Galois theory of iterates of quadratic polynomials. As an example, we characterize completely the set of quadratic polynomials $x^2+c$ whose third iterate…
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this…
In this paper, we describe Galois covers of algebraic curves and their families by using local systems associated to push-forward of sheaves by the structure morphism. More precisely, if $f:C\to Y$, we consider the sheaves $f_*(\C)$. The…
Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…
This paper presents a connection between Galois points and rational functions over a finite field with small value sets. This paper proves that the defining polynomial of any plane curve admitting two Galois points is an irreducible…
We prove that the number of unimodular integral matrices in a norm ball whose characteristic polynomial has Galois group different than the full symmetric group is of strictly lower order of magnitude than the number of all such matrices in…
We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller…
Given a set $S=\{x^2+c_1,\dots,x^2+c_s\}$ defined over a field and an infinite sequence $\gamma$ of elements of $S$, one can associate an arboreal representation to $\gamma$, generalizing the case of iterating a single polynomial. We study…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
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 compute the Galois group of a polynomial whose roots are determined by the critical points of a scalar potential in type IIB compactifications. We focus our study on certain perturbative models where it is feasible to construct a de…
Given fields $k \subseteq L$, our results concern one parameter $L$-parametric polynomials over $k$, and their relation to generic polynomials. The former are polynomials $P(T,Y) \in k[T][Y]$ of group $G$ which parametrize all Galois…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
We introduce the parameterized generic Galois group of a q-difference module, that is a differential group in the sense of Kolchin. It is associated to the smallest differential tannakian category generated by the q-difference module,…
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…
In this article, we consider the inverse Galois problem for parameterized differential equations over k((t))(x) with k any field of characteristic zero and use the method of patching over fields due to Harbater and Hartmann. As an…