• Corpus ID: 235669922

On a conjecture of Gowers and Wolf

  title={On a conjecture of Gowers and Wolf},
  author={Daniel Altman},
: Gowers and Wolf have conjectured that, given a set of linear forms { ψ i } ti = 1 each mapping Z D to Z , if s is an integer such that the functions ψ s + 1 i ,..., ψ s + 1 t are linearly independent, then averages of the form E x ∏ ti = 1 f ( ψ i ( x )) may be controlled by the Gowers U s + 1 -norm of f . We prove (a stronger version of) this conjecture. 
3 Citations

Overleaf Example

Green and Tao’s arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the ‘flag condition’. We give an

A refinement of Cauchy-Schwarz complexity

On several notions of complexity of polynomial progressions

  • B. Kuca
  • Mathematics, Computer Science
    Ergodic Theory and Dynamical Systems
  • 2022
It is shown that Weyl complexity and algebraic complexity always agree, which gives a straightforward algebraic description of Wey complexity.



True complexity of polynomial progressions in finite fields

  • B. Kuca
  • Mathematics
    Proceedings of the Edinburgh Mathematical Society
  • 2021
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

Higher Order Fourier Analysis

Traditional Fourier analysis, which has been remarkably effective in many contexts, uses linear phase functions to study functions. Some questions, such as problems involving arithmetic progressions,

Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms

For a given linear structure, the smallest degree of uniformity k is found such that assuming that ‖f2‖Uk is sufficiently small, it is possible to discard f2 and replace 1A with f1, affecting the corresponding analytic average only negligibly.

Linear equations in primes

Consider a system ψ of nonconstant affine-linear forms ψ 1 , ... , ψ t : ℤ d → ℤ, no two of which are linearly dependent. Let N be a large integer, and let K ⊆ [-N, N] d be convex. A generalisation

An Arithmetic Regularity Lemma, An Associated Counting Lemma, and Applications

To Endre Szemeredi on the occasion of his 70th birthday Szemeredi’s regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured


We give improved bounds for our theorem in [W. T. Gowers and J. Wolf, The true complexity of a system of linear equations. Proc. London Math. Soc.  (3) 100 (2010), 155–176], which shows that a system

The true complexity of a system of linear equations

In this paper we look for conditions that are sufficient to guarantee that a subset A of a finite Abelian group G contains the ‘expected’ number of linear configurations of a given type. The simplest