English
Related papers

Related papers: Three-variable expanding polynomials and higher-di…

200 papers

Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive…

Number Theory · Mathematics 2013-12-24 Xiang-dong Hou , Stephen D. Lappano

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

Number Theory · Mathematics 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

Dynamical Systems · Mathematics 2014-10-02 Vladimir Dragovic , Katarina Kukic

Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…

Number Theory · Mathematics 2013-09-16 Xiang-dong Hou

In this paper, we consider a variant of Tur\'an's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$,…

Number Theory · Mathematics 2018-08-16 Artūras Dubickas , Min Sha

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

Number Theory · Mathematics 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

We investigate the arithmetic properties of the multiplier polynomials for certain $1$-parameter families of polynomials. In particular, we prove integrality theorems of multiplier polynomials for $z^d+c$, $(z-c)z^d + c$ and $z^{d+1}+cz$.…

Dynamical Systems · Mathematics 2025-03-05 Yuya Murakami , Kaoru Sano , Kohei Takehira

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

Logic in Computer Science · Computer Science 2026-05-19 Piotr Bacik , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , Madhavan Venkatesh , Emil Rugaard Wieser

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

The main result in this paper concerns a new five-variable expander. It is proven that for any finite set of real numbers $A$, $$|\{(a_1+a_2+a_3+a_4)^2+\log a_5 :a_1,a_2,a_3,a_4,a_5 \in A \}| \gg \frac{|A|^2}{\log |A|}.$$ This bound is…

Combinatorics · Mathematics 2017-04-05 Oliver Roche-Newton

It is shown that the classical quadratic and cubic transformation identities satisfied by the hypergeometric function ${}_3F_2$ can be extended to include additional parameter pairs, which differ by integers. In the extended identities,…

Classical Analysis and ODEs · Mathematics 2023-02-15 Robert S. Maier

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

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

Number Theory · Mathematics 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

Let $f(x) \in \mathbb{C}[x]$ of degree $n$. We attach to $f$ a $\mathbb{C}$-vector space $W(f)$ which consists of complex polynomials $p(x)$ of degree at most $n - 2$ such that $f(x)$ divides $f"(x)p(x) - f'(x) p'(x)$. The space $W(f)$…

Algebraic Geometry · Mathematics 2019-11-18 Zhaoning Yang

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

Number Theory · Mathematics 2013-08-15 Alexei Entin

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 consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…

Number Theory · Mathematics 2017-04-21 Roger Baker