Related papers: On the proportion of irreducible polynomials in un…

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…

A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\varepsilon_q d-1)/(p-1)$, where…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

For every integer $k$ there exists a bound $B=B(k)$ such that if the characteristic polynomial of $g\in \operatorname{SL}_n(q)$ is the product of $\le k$ pairwise distinct monic irreducible polynomials over $\mathbb{F}_q$, then every…

Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Let $K$ be a number field with ring of integers $\mathbb{Z}_K$. We prove two asymptotic formulas connected with the distribution of irreducible elements in $\mathbb{Z}_K$. First, we estimate the maximum number of nonassociated irreducibles…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…