English
Related papers

Related papers: The distance to square-free polynomials

200 papers

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

Number Theory · Mathematics 2014-07-02 Won-Ho Ri , Gum-Chol Myong , Ryul Kim , Chang-Il Rim

We determine which quadratic polynomials in three variables are expanders over an arbitrary field $\mathbb{F}$. More precisely, we prove that for a quadratic polynomial $f\in \mathbb{F}[x,y,z]$, which is not of the form $g(h(x)+k(y)+l(z))$,…

Combinatorics · Mathematics 2017-02-27 Thang Pham , Le Anh Vinh , Frank de Zeeuw

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…

Data Structures and Algorithms · Computer Science 2022-04-19 Vipul Arora , Arnab Bhattacharyya , Noah Fleming , Esty Kelman , Yuichi Yoshida

Given $f\in \mathbb{Z}[t]$ of positive degree, we investigate the existence of auxiliary polynomials $g\in \mathbb{Z}[t]$ for which $f(g(t))$ factors as a product of polynomials of small relative degree. One consequence of this work shows…

Number Theory · Mathematics 2017-10-06 Jonathan Bober , Dan Fretwell , Greg Martin , Trevor D. Wooley

For a real polynomial $f$ we present explicit zero-free angular sectors in the complex plane, symmetric with respect to the real axis, with angles depending only on the degree of $f$, and vertices expressed in terms of the coefficients of…

Number Theory · Mathematics 2021-10-05 Ciprian Mircea Bonciocat , Nicolae Ciprian Bonciocat

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Number Theory · Mathematics 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Number Theory · Mathematics 2019-03-11 Marc Munsch , Igor E. Shparlinski , Kam Hung Yau

We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free…

Number Theory · Mathematics 2026-01-21 Daniel R. Johnston , Bryce Kerr

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Number Theory · Mathematics 2016-09-02 Jie Wu , Ping Xi

In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…

Number Theory · Mathematics 2023-11-28 Jitender Singh , Sanjeev Kumar

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

Commutative Algebra · Mathematics 2018-01-18 Beata Hejmej

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

Number Theory · Mathematics 2026-01-21 Biao Wang , Shaoyun Yi

Let X be a smooth curve over a finite field of characteristic p, let l be a prime number different from p, and let L be an irreducible lisse l-adic sheaf on X whose determinant is of finite order. By a theorem of Lafforgue, for each prime…

Algebraic Geometry · Mathematics 2007-05-23 CheeWhye Chin

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

Number Theory · Mathematics 2009-09-02 Thai Hoang Le

Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any…

Number Theory · Mathematics 2023-10-05 Angel Kumchev , Nathan McNew , Ariana Park

A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…

Combinatorics · Mathematics 2017-06-14 Anurag Bishnoi , Pete L. Clark , Aditya Potukuchi , John R. Schmitt

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

Commutative Algebra · Mathematics 2020-05-12 John Abbott

Let $\mathcal R$ be a principal ideal domain and $\mathcal K = {\rm quot}(\mathcal R)$. Assume that $P_1,\ldots P_n\in \mathcal K[X]$ are polynomials which take $\mathcal R$ to $\mathcal R$, and $P$ is their product. If the $P_i$ satisfy…

Number Theory · Mathematics 2022-09-09 Michaël Bensimhoun