English
Related papers

Related papers: Inverse Conjecture for the Gowers norm is false

200 papers

We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and || f…

Number Theory · Mathematics 2012-01-04 Ben Green , Terence Tao , Tamar Ziegler

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…

Combinatorics · Mathematics 2011-09-09 Terence Tao , Tamar Ziegler

The inverse conjecture for the Gowers norms $U^d(V)$ for finite-dimensional vector spaces $V$ over a finite field $\F$ asserts, roughly speaking, that a bounded function $f$ has large Gowers norm $\|f\|_{U^d(V)}$ if and only if it…

Combinatorics · Mathematics 2012-01-04 Terence Tao , Tamar Ziegler

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

Number Theory · Mathematics 2011-05-31 Ben Green , Terence Tao , Tamar Ziegler

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…

Combinatorics · Mathematics 2026-04-24 Ben Green , Terence Tao , Tamar Ziegler

We consider the problem of testing if a given function f : F_2^n -> F_2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem. The Gowers norm is based on a natural 2^{d+1}-query test for this…

Combinatorics · Mathematics 2010-04-12 Arnab Bhattacharyya , Swastik Kopparty , Grant Schoenebeck , Madhu Sudan , David Zuckerman

The Gowers U^3 norm is one of a sequence of norms used in the study of arithmetic progressions. If G is an abelian group and A is a subset of G then the U^3(G) of the characteristic function 1_A is useful in the study of progressions of…

Number Theory · Mathematics 2023-12-08 Ben Green , Terence Tao

This paper is the third part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

Number Theory · Mathematics 2024-07-29 Wenbo Sun

In this note we characterize when non-classical polynomials are necessary in the inverse theorem for the Gowers $U^k$-norm. We give a brief deduction of the fact that a bounded function on $\mathbb F_p^n$ with large $U^k$-norm must…

Combinatorics · Mathematics 2022-10-28 Aaron Berger , Ashwin Sah , Mehtaab Sawhney , Jonathan Tidor

We establish a correspondence between inverse sumset theorems (which can be viewed as classifications of approximate (abelian) groups) and inverse theorems for the Gowers norms (which can be viewed as classifications of approximate…

Number Theory · Mathematics 2015-05-13 Ben Green , Terence Tao

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…

Combinatorics · Mathematics 2007-11-21 Ben Green , Terence Tao

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

Computational Complexity · Computer Science 2013-01-18 Arnab Bhattacharyya , Eldar Fischer , Hamed Hatami , Pooya Hatami , Shachar Lovett

It was conjectured by Bergelson, Tao, and Ziegler \cite{btz} that every Host--Kra $\F_p^\omega$-system of order $k$ is an Abramov system of order $k$. This conjecture has been verified for $k \leq p+1$. In this paper we show that the…

Dynamical Systems · Mathematics 2026-01-07 Asgar Jamneshan , Or Shalom , Terence Tao

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…

Combinatorics · Mathematics 2024-09-13 Sean Prendiville

We prove a nearly polynomial inverse theorem for the Gowers $U^d$ norm, over finite fields of non-small characteristic, for polynomials of degree $d+1$. The case of degree $d$ was very recently settled by Mili\'{c}evi\'{c} and…

Combinatorics · Mathematics 2026-05-01 Tomer Milo , Guy Moshkovitz

A remarkable result of Bergelson, Tao and Ziegler implies that if $c>0$, $k$ is a positive integer, $p\geq k$ is a prime, $n$ is sufficiently large, and $f:\mathbb F_p^n\to\mathbb C$ is a function with $\|f\|_\infty\leq 1$ and…

Combinatorics · Mathematics 2017-12-04 W. T. Gowers , Luka Milićević

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Computational Complexity · Computer Science 2015-03-27 Yuichi Yoshida

The inverse theory for Gowers uniformity norms is one of the central topics in additive combinatorics and one of the most important aspects of the theory is the question of bounds. In this paper, we prove a quasipolynomial inverse theorem…

Combinatorics · Mathematics 2024-10-28 Luka Milićević

We prove estimates for the Gowers uniformity norms of functions over $\Zz/p\Zz$ which are trace functions of certain $\ell$-adic sheaves, and establish in particular a strong inverse theorem for these functions.

Number Theory · Mathematics 2013-02-12 Étienne Fouvry , Emmanuel Kowalski , Philippe Michel

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a…

Computational Complexity · Computer Science 2013-08-14 Hamed Hatami , Shachar Lovett
‹ Prev 1 2 3 10 Next ›