True complexity of polynomial progressions in finite fields
From MaRDI portal
Publication:5159375
Abstract: 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 relates true complexity to algebraic relations between the terms of the progression, and we prove it for a number of progressions, including and . As a corollary, we prove an asymptotic for the count of certain progressions of complexity 1 in subsets of finite fields. In the process, we obtain an equidistribution result for certain polynomial progressions, analogous to the counting lemma for systems of linear forms proved by Green and Tao.
Recommendations
- The true complexity of a system of linear equations
- Three-term polynomial progressions in subsets of finite fields
- On the polynomial Szemerédi theorem in finite fields
- Further bounds in the polynomial Szemerédi theorem over finite fields
- General systems of linear forms: equidistribution and true complexity
Cites work
- A new proof of Szemerédi's theorem
- Additive combinatorics
- An arithmetic regularity lemma, an associated counting lemma, and applications
- AN INVERSE THEOREM FOR THE GOWERS U^3(G) NORM
- An inverse theorem for the Gowers U^4-norm
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- Bounds for sets with no polynomial progressions
- Complexities of finite families of polynomials, Weyl systems, and constructions in combinatorial number theory
- Convergence of polynomial ergodic averages
- Convergence results for systems of linear forms on cyclic groups and periodic nilsequences
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
- Further bounds in the polynomial Szemerédi theorem over finite fields
- Good bounds in certain systems of true complexity one
- scientific article; zbMATH DE number 5219603 (Why is no real title available?)
- Improved estimates for polynomial Roth type theorems in finite fields
- Linear equations in primes
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- Linear forms and quadratic uniformity for functions on F^n_p
- Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
- Multiple ergodic averages for three polynomials and applications
- Nilpotent structures in ergodic theory
- Nonconventional ergodic averages and nilmanifolds
- Nonlinear Roth type theorems in finite fields
- On the polynomial Szemerédi theorem in finite fields
- Orbit of the diagonal in the power of a nilmanifold
- Polynomial averages converge to the product of integrals
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- The quantitative behaviour of polynomial orbits on nilmanifolds
- The true complexity of a system of linear equations
- Three-term polynomial progressions in subsets of finite fields
Cited in
(6)- Three-term polynomial progressions in subsets of finite fields
- Lower bounds of complexity for polarized polynomials over finite fields
- On the polynomial Szemerédi theorem in finite fields
- scientific article; zbMATH DE number 1866875 (Why is no real title available?)
- On several notions of complexity of polynomial progressions
- Multidimensional polynomial patterns over finite fields: bounds, counting estimates and Gowers norm control
This page was built for publication: True complexity of polynomial progressions in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159375)
