相关论文: Irreducibility criterion for certain trinomials

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we…

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

Heath-Brown proved that for a positive proportion of integers $n$, $n^3+2$ has a prime factor larger than $n^{1+c}$ with $c=10^{-303}$. We generalize this result to arbitrary monic irreducible cubic polynomial of $\mathbb{Z}[x]$ with $c$…

We prove that for every $\varepsilon>0$ and a nonnegative integer $\omega$ there exist primes $p_1,p_2,\ldots,p_\omega$ such that for $n=p_1p_2\ldots p_\omega$ the height of the cyclotomic polynomial $\Phi_n$ is at least…

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of $f\bmod p$. We…

This paper was removed due to an error in the proof (Claim 4.12 as stated is not true). The authors would like to thank Ilya Volkovich for pointing out a counterexample to this paper's main result in positive characteristic: If $F$ is a…

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

In this paper, we present some necessary and sufficient conditions under which an irreducible polynomial is self-reciprocal (SR) or self-conjugate-reciprocal (SCR). By these characterizations, we obtain some enumeration formulas of SR and…

Let $P(X)\in\mathbb{Z}[X]$ be an irreducible, monic, quartic polynomial with cyclic or dihedral Galois group. We prove that there exists a constant $c_P>0$ such that for a positive proportion of integers $n$, $P(n)$ has a prime factor $\ge…

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

Very simple sufficient conditions for the irreducibility of $f(X^n)$ over an arbitrary unique factorization domain $Z$ are established via a generalization of a well known theorem of A. Capelli.

A polynomial f(x) has emergent reducibility at depth n if f^{\circ k}(x) is irreducible for 0\leq k\leq n-1 but f^{\circ n}(x) is reducible. In this paper we prove that there are infinitely many irreducible cubics f \in \mathbb{Z}[x] with…

We show that, for generic bihomogeneous polynomials, the determinant of the matrix of moving planes is irreducible.