Related papers: Chebyshev polynomials and Galois groups of De Moiv…

Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or…

The discrete Fourier analysis on the $30^{\degree}$-$60^{\degree}$-$90^{\degree}$ triangle is deduced from the corresponding results on the regular hexagon by considering functions invariant under the group $G_2$, which leads to the…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

We explain in detail the definition, construction and generalisation of the Galois group of Chebyshev polynomials of high degree to the Galois group of chaotic chains. The calculations in this paper are performed for Chebyshev polynomials…

How often is a quintic polynomial solvable by radicals? We establish that the number of such polynomials, monic and irreducible with integer coefficients in $[-H,H]$, is $O(H^{3.91})$. More generally, we show that if $n \ge 3$ and $n \notin…

In the mid sixties, A. Grothendieck envisioned a vast generalization of Galois theory to systems of polynomials in several variables, motivic Galois theory, and introduced tannakian categories on this occasion. In characteristic zero,…

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…

We show that there are $O_\varepsilon(H^{1.5+\varepsilon})$ monic, cubic polynomials with integer coefficients bounded by $H$ in absolute value whose Galois group is $A_3$. We also show that the order of magnitude for $D_4$ quartics is $H^2…

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…

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…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…

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$…

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

By using purely algebraic tools, we establish well-known properties of roots of Chebyshev polynomials. Especially, we show that these zeros are simple and lie in $(-1,1)$ and we prove in two ways that they are mostly irrational.

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…

In the process of computing the Galois group of a prime degree polynomial $f(x)$ over $\mathbb Q$ we suggest a preliminary checking for the existence of non-real roots. If $f(x)$ has non-real roots, then combining a 1871 result of Jordan…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…