Related papers: Splitting Behavior of $S_n$-Polynomials

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

We show that there are at most $O_{n,\epsilon}(H^{n-2+\sqrt{2}+\epsilon})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973…

We study the number $M_n(T)$ be the number of integer $n\times n$ matrices $A$ with entries bounded in absolute value by $T$ such that the Galois group of characteristic polynomial of $A$ is not the full symmetric group $S_n$. One knows…

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…

We consider the zero distribution of random polynomials of the form $P_n(z) = \sum_{k=0}^n a_k B_k(z)$, where $\{a_k\}_{k=0}^{\infty}$ are non-trivial i.i.d. complex random variables with mean $0$ and finite variance. Polynomials…

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

We characterize the fixed divisor of a polynomial $f(X)$ in $\mathbb{Z}[X]$ by looking at the contraction of the powers of the maximal ideals of the overring ${\rm Int}(\mathbb{Z})$ containing $f(X)$. Given a prime $p$ and a positive…

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…

We introduce and study a class of determinantal probability measures generalising the class of discrete determinantal point processes. These measures live on the Grassmannian of a real, complex, or quaternionic inner product space that is…

Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same…

Let $f:X\to X $ be a dominant self-morphism of an algebraic variety over an algebraically closed field of characteristic zero. We consider the set $\Sigma_{f^{\infty}}$ of $f$-periodic (irreducible closed) subvarieties of small dynamical…

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…

Proving a conjecture of Miller, we show that as $n$ tends to infinity almost all entries in the character table of $S_n$ are divisible by any given prime power. This extends our earlier work which treated divisibility by primes.

For a number field K and a finite abelian group G, we determine the probabilities of various local completions of a random G-extension of K when extensions are ordered by conductor. In particular, for a fixed prime p of K, we determine the…

The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

In this paper, we consider infinite Galois extensions of number fields and study the relation between their local degrees and the structure of their Galois groups. It is known that, if $K$ is a number field and $L/K$ is an infinite Galois…