Related papers: Polynomial Bounds for Birch's Theorem

S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…

Let $n \geq 2$ be an integer and let $K$ be a number field with ring of integers $\mathcal{O}_K$. We prove that the set of ternary $n$-ic forms with coefficients in $\mathcal{O}_K$ and fixed nonzero discriminant, breaks up into finitely…

In this paper we prove the following theorem. Let $f:\mathbb{A}^2\rightarrow \mathbb{A}^2$ be a dominate polynomial endomorphisms defined over an algebraically closed field $k$ of characteristic $0$. If there are no nonconstant rational…

In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…

We prove several results on the number of rational points on open subsets of Kummer varieties of arbitrary dimension. Some of our results are unconditional, and others depend on the Parity Conjecture (a corollary of the Conjecture of Birch…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Let K be a number field with algebraic closure K-bar, let S be a finite set of places of K containing the archimedean places, and let f be a Chebyshev polynomial. We prove that if a in K-bar is not preperiodic, then there are only finitely…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Recall that combinatorial $2s$-designs admit a classical lower bound $b \ge \binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

We consider the Bohr radius $R_n$ for the class of complex polynomials in one variable of degree at most $n$. It was conjectured by R. Fournier in 2008 that $R_n={1\over 3}+{\pi^2\over {3n^2}}+o({1\over n^2})$. We shall prove this…

Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…

We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of nonnegative distinct monomials. This bound was conjectured by John P. D'Angelo, proved in two dimensions by D'Angelo, Kos and Riehl and in three…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of…

In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

Let $K$ be the field of Laurent series with complex coefficients, let $\mathcal{R}$ be the inverse limit of the standard-graded polynomial rings $K[x_1, \ldots, x_n]$, and let $\mathcal{R}^{\flat}$ be the subring of $\mathcal{R}$ consisting…

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…