Related papers: Galois groups of random integer polynomials and va…

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

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.

Let $n$ be a positive integer and $G$ be a transitive permutation subgroup of $S_n$. Given a number field $K$ with $[K:\mathbb{Q}]=n$, we let $\widetilde{K}$ be its Galois closure over $\mathbb{Q}$ and refer to…

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q_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 irreducible…

We prove an irreducibility criterion for polynomials of the form $h(x)=x^{2m} + bx^m + c_1 \in F[x]$ relating to the Dickson polynomials of the first kind $D_p$. In the case when $F = \mathbb{Q}$, $m$ is a prime $p>3$, and $c_1=c^p$, for…

For real number $\alpha,$ Generalised Laguerre Polynomials (GLP) is a family of polynomials defined by \begin{align*} L_n^{(\alpha)}(x)=(-1)^n\displaystyle\sum_{j=0}^{n}\binom{n+\alpha}{n-j}\frac{(-x)^j}{j!}. \end{align*}These orthogonal…

Let $K$ be a number field and $f\in K[X]$ an irreducible monic polynomial with coefficients in $O_K$, the ring of integers of $K$. We aim to enounce an effective criterion, in terms of the Galois group of $f$ over $K$ and a linear…

Conditionally on the Riemann hypothesis for certain Dedekind zeta functions, we show that the characteristic polynomial of a class of random tridiagonal matrices of large dimension is irreducible, with probability exponentially close to…

Suppose that $f(x)=x^4+Ax^3+Bx^2+Ax+1\in {\mathbb Z}[x]$. We say that $f(x)$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\theta^3\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Let $n\ge 3$ be an odd natural number. In 1738, Abraham de Moivre introduced a family of polynomials of degree $n$ with rational coefficients, all of which are solvable. So far, the Galois groups of these polynomials have been investigated…

We extend several predecessor works on even sextic monogenic polynomials. In particular, we prove a conjecture of Lenny Jones, thereby classifying even sextic monogenic polynomials with cyclic Galois group. This result is key to completing…

The link between Vandiver's conjecture and Gauss sums is well known since the papers of Iwasawa (1975), Thaine (1995-1999) and Angl{\`e}s-Nuccio (2010). This conjecture is required in many subjects and we shall give such examples of…

We prove many new cases of the Inverse Galois Problem for those simple groups arising from orthogonal groups over finite fields. For example, we show that the finite simple groups Omega_{2n+1}(p) and POmega_{4n}^+(p) both occur as the…

In 1985, Odoni showed that in characteristic $0$ the Galois group of the $n$-th iterate of the generic polynomial with degree $d$ is as large as possible. That is, he showed that this Galois group is the $n$-th wreath power of the symmetric…

In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus.…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

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…

An intersective polynomial is a monic polynomial in one variable with rational integer coefficients, with no rational root and having a root modulo $m$ for all positive integers $m$. Let $G$ be a finite noncyclic group and let $r(G)$ be the…

We provide evidence for a conjecture of Yamamura that the truncated logarithmic polynomials \[ F_n(x) = 1 + x + \frac{x^2}{2} + \cdots + \frac{x^n}{n} \] have Galois group $S_n$ for all $n \geq 1$.