Related papers: Optimal Polynomial Recurrence

Let $A\subseteq\{1,...,N\}$ and $P_1,...,P_\ell\in\Z[n]$ with $P_i(0)=0$ and $\deg P_i=k$ for every $1\leq i\leq\ell$. We show, using Fourier analytic techniques, that for every $\VE>0$, there necessarily exists $n\in\N$ such that…

Using Fourier analytic techniques, we prove that if $\VE>0$, $N\geq \exp\exp(C\VE^{-1}\log\VE^{-1})$ and $A\subseteq\{1,...,N\}$, then there must exist $t\in\N$ such that \[\frac{|A\cap (A+t^2)|}{N}>(\frac{|A|}{N})^2-\VE.\] This is a…

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Let $E\subset \mathbb Z$ be a set of positive upper density. Suppose that $P_1,P_2,..., P_k\in \mathbb Z[X]$ are polynomials having zero constant terms. We show that the set $E\cap (E-P_1(p-1))\cap ... \cap (E-P_k(p-1))$ is non-empty for…

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

Let $E = \cup_{j = 1}^l [a_{2j-1},a_{2j}],$ $a_1 < a_2 < ... < a_{2l},$ $l \geq 2$ and set ${\boldmath$\omega$}(\infty) =(\omega_1(\infty),...,\omega_{l-1}(\infty))$, where $\omega_j(\infty)$ is the harmonic measure of $[a_{2 j - 1}, a_{2…

Call a (strictly increasing) sequence $(r_{n})$ of natural numbers \emph{regular} if it satisfies the following condition: $r_{n+1}/r_{n}\to\theta\in\mathbb{R}^{>1}\cup\{\infty\}$ and, if $\theta$ is algebraic, then $(r_{n})$ satisfies a…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

Let $M$ be a fixed positive integer. Let $(R_{j}(n))_{n\ge 1}$ be a linear recurrence sequence for every $j=0,1,\ldots, M$, and we set $f(n)=(R_0\circ \cdots \circ R_M)(n)$, where $(S\circ T)(n)= S(T(n))$. In this paper, we obtain…

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

For a polynomial $f(X)=AX^d+C \in \mathbb{F}_p[X]$ with $A\neq 0$ and $d\geq 2$, we prove that if $d\;|\;p-1$ and $f^i(0)\neq f^j(0)$ for $0\leq i<j\leq N$, then $\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$ where $f^N$ is the $N$-th…

A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$…

In this paper, among other things, we show that, given $r\in N$, there is a constant $c=c(r)$ such that if $f\in C^r[-1,1]$ is convex, then there is a number ${\mathcal N}={\mathcal N}(f,r)$, depending on $f$ and $r$, such that for…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

We extend our result on the convergence of double recurrence Wiener-Wintner averages to the case where we have a polynomial exponent. We will show that there exists a single set of full measure for which the averages \[ \frac{1}{N}…

Let $F$ and $G$ be linear recurrences over a number field $\mathbb{K}$, and let $\mathfrak{R}$ be a finitely generated subring of $\mathbb{K}$. Furthermore, let $\mathcal{N}$ be the set of positive integers $n$ such that $G(n) \neq 0$ and…

We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in…

We study residual polynomials, $R_{x_0,n}^{(\mathfrak{e})}$, $\mathfrak{e}\subset\mathbb{R}$, $x_0\in\mathbb{R}\setminus\mathfrak{e}$, which are the degree at most $n$ polynomials with $R(x_0)=1$ that minimize the $\sup$ norm on…

We give an algorithm for $\ell_2/\ell_2$ sparse recovery from Fourier measurements using $O(k\log N)$ samples, matching the lower bound of \cite{DIPW} for non-adaptive algorithms up to constant factors for any $k\leq N^{1-\delta}$. The…

A sequence $\{ a_n \}_{n \ge 0}$ is said to be asymptotically $r$-log-convex if it is $r$-log-convex for $n$ sufficiently large. We present a criterion on the asymptotical $r$-log-convexity based on the asymptotic behavior of $a_n…