Related papers: Multidimensional polynomial patterns over finite f…

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…

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…

Using PET and quantitative concatenation techniques, we establish box-norm control with the "expected" directions for counting operators for general multidimensional polynomial progressions, with at most polynomial losses in the parameters.…

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

In this paper, we prove power-saving bounds for the corelation of the M\"obius function with polynomial phases of degree $k$ in function fields $\mathbb{F}_p[t]$, when $p > k$. The proof relies on a new approximation result for phases of…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

We examine the limiting behavior of multiple ergodic averages associated with arithmetic progressions whose differences are elements of a fixed integer sequence. For each $\ell$, we give necessary and sufficient conditions under which…

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…

In this paper we generalize the Ritt-Kolchin method of characteristic sets and the classical Gr\"obner basis technique to prove the existence and obtain methods of computation of multivariate difference-differential dimension polynomials…

We study the weighted multilinear polynomial averages in finite fields. The essential ingredient is the $u^s$-norm control of the corresponding weighted multilinear polynomial averages in finite fields, which is motivated by Ter\"av\"ainen…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

We examine multiple ergodic averages of commuting transformations with polynomial iterates in which the polynomials may be pairwise dependent. In particular, we show that such averages are controlled by the Gowers-Host-Kra seminorms…

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…

We study multiple orthogonal polynomials of Meixner-Pollaczek type with respect to a symmetric system of two orthogonality measures. Our main result is that the limiting distribution of the zeros of these polynomials is one component of the…