Related papers: On rational functions with monodromy group $M_{11}…
There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…
A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…
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 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…
We construct a family of quartic polynomials with cyclic Galois group and show that the roots of the polynomials are fundamental units or generate a subgroup of index 5.
A linearized function field $F$ can be viewed as a Galois extension of a rational function field $K(x)$. For a totally ramified place $Q$ of degree one in $F/K(x)$, we give a unified description of the set $G(Q)$ of gaps at $Q$. As a…
The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
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…
We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…
We compute the Galois group of the splitting field $F$ of any irreducible and separable polynomial $f(x)=x^6+ax^3+b$ with $a,b\in K$, a field with characteristic different from two. The proofs require to distinguish between two cases:…
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…
Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…
For every nonconstant rational function $\phi\in\mathbb{Q}(x)$, the Galois groups of the dynatomic polynomials of $\phi$ encode various properties of $\phi$ that are of interest in the subject of arithmetic dynamics. We study here the…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
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.
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
It is now known that for any prime p and any finite semiabelian p-group G, there exists a (tame) realization of G as a Galois group over the rationals Q with exactly d = d(G) ramified primes, where d(G) is the minimal number of generators…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…