Related papers: Recurrence and non-uniformity of bracket polynomia…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

Assume that $m,s\in\mathbb N$, $m>1$, while $f$ is a polynomial with integer coefficients, $\text{deg}~f>1$, $f^{(i)}$ is the $i$th iteration of the polynomial $f$, $\kappa_n$ has a discrete uniform distribution on the set $\{0,1,\ldots,m^n…

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Let $G_1,..., G_n \in \Fp[X_1,...,X_m]$ be $n$ polynomials in $m$ variables over the finite field $\Fp$ of $p$ elements. A result of {\'E}. Fouvry and N. M. Katz shows that under some natural condition, for any fixed $\varepsilon$ and…

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

A group of order $p^n$ ($p$ prime) has an indecomposable polynomial invariant of degree at least $p^{n-1}$ if and only if the group has a cyclic subgroup of index at most $p$ or it is isomorphic to one of two particular groups of small…

We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…

For $p$ prime, let $\mathcal{H}^n$ be the linear span of characteristic functions of hyperplanes in $(\mathbb{Z}/p^k\mathbb{Z})^n$. We establish new upper bounds on the dimension of $\mathcal{H}^n$ over $\mathbb{Z}/p\mathbb{Z}$, or…

We consider multivariate polynomials and investigate how many zeros of multiplicity at least $r$ they can have over a Cartesian product of finite subsets of a field. Here r is any prescribed positive integer and the definition of…

Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…

For a polynomial $P$ mapping the integers into the integers, define an averaging operator $A_{N} f(x):=\frac{1}{N}\sum_{k=1}^N f(x+P(k))$ acting on functions on the integers. We prove sufficient conditions for the $\ell^{p}$-improving…

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…

For all natural numbers $N$ and prime numbers $p$, we find a knot $K$ whose skein polynomial $P_K(a,z)$ evaluated at $z=N$ has trivial reduction modulo $p$. An interesting consequence of our construction is that all polynomials $P_K(a,N)$…

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

We prove quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm. The proof is modeled after work of Green, Tao, and Ziegler and uses as a crucial input recent work of the first author regarding the equidistribution…

Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial $f$ if it applies to the number field $K=\mathbb{Q}[x]/(f)$…

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…