SearcharxivSearch

arXiv subjects

W. T. Gowers

Publications and source records attributed to W. T. Gowers.

At least 19 recordsLinked to original sources

Product-free subsets of $(0,1)$

The third problem in Ben Green's collection of 100 open problems asks whether an open subset of $(0,1)$ that does not contain $x,y,z$ with $xy=z$ must have measure at most 1/3. We give an affirmative answer to this question. As part of the proof we obtain a result of independent interest that gives a lower bound for the size of the sumset and the difference set of a set of reals in terms not just of its size but also of a parameter that measures how far it is from being an interval.

math.CO

Remarks on the disproof of the unit distance conjecture

We present a short, digested, human-verified version of the recent OpenAI-generated counterexample to the Erdős unit distance conjecture, and a sequence of reflections on it. The argument relies crucially on ideas that may, at least in retrospect, be attributed to Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna.

math.CO

Marton's Conjecture in abelian groups with bounded torsion

We prove a Freiman--Ruzsa-type theorem with polynomial bounds in arbitrary abelian groups with bounded torsion, thereby proving (in full generality) a conjecture of Marton. Specifically, let $G$ be an abelian group of torsion $m$ (meaning $mg=0$ for all $g \in G$) and suppose that $A$ is a non-empty subset of $G$ with $|A+A| \leq K|A|$. Then $A$ can be covered by at most $(2K)^{O(m^3)}$ translates of a subgroup of $H \leq G$ of cardinality at most $|A|$. The argument is a variant of that used in the case $G = \mathbf{F}_2^n$ in a recent paper of the authors.

math.NT

On a conjecture of Marton

We prove a conjecture of K. Marton, widely known as the polynomial Freiman--Ruzsa conjecture, in characteristic $2$. The argument extends to odd characteristic, with details to follow in a subsequent paper.

math.NT

Low-complexity approximations for sets defined by generalizations of affine conditions

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<ε\leq 1$. We show that there exists a constant $C=C(p, ε)$ such that for every positive integer $k$, whenever $ϕ_1, \dots, ϕ_k: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ are linear forms and $E_1, \dots, E_k$ are subsets of $\mathbb{F}_p$, there exist linear forms $ψ_1, \dots, ψ_C: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ and subsets $F_1, \dots, F_C$ of $\mathbb{F}_p$ such that the set $U=\{x \in S^n: ψ_1(x) \in F_1, \dots, ψ_C(x) \in F_C\}$ is contained inside the set $V=\{x \in S^n: ϕ_1(x) \in E_1, \dots, ϕ_k(x) \in E_k\}$, and the difference $V \setminus U$ has density at most $ε$ inside $S^n$. We then generalize this result to one where $ϕ_1, \dots, ϕ_k$ are replaced by homomorphisms $G^n \to H$ for some pair of finite Abelian groups $G$ and $H$, and to another where they are replaced by polynomial maps $\mathbb{F}_p^n \to \mathbb{F}_p$ of small degree.

math.CO

Equidistribution of high-rank polynomials with variables restricted to subsets of $\mathbb{F}_p$

Let $p$ be a prime and let $S$ be a non-empty subset of $\mathbb{F}_p$. Generalizing a result of Green and Tao on the equidistribution of high-rank polynomials over finite fields, we show that if $P: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ is a polynomial and its restriction to $S^n$ does not take each value with approximately the same frequency, then there exists a polynomial $P_0: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ that vanishes on $S^n$, such that the polynomial $P-P_0$ has bounded rank. Our argument uses two black boxes: that a tensor with high partition rank has high analytic rank and that a tensor with high essential partition rank has high disjoint partition rank.

math.CO

High-dimensional tennis balls

We show that there exist constants $α,ε>0$ such that for every positive integer $n$ there is a continuous odd function $f:S^m\to S^n$, with $m\geq αn$, such that the $ε$-expansion of the image of $f$ does not contain a great circle. We also show how this result is connected to a conjecture of Vitali Milman about well-complemented almost Euclidean subspaces of spaces uniformly isomorphic to $\ell_2^n$.

math.FA

A counterexample to a strengthening of a question of Milman

Let $|\cdot|$ be the standard Euclidean norm on $\mathbb{R}^n$ and let $X=(\mathbb{R}^n,\|\cdot\|)$ be a normed space. A subspace $Y\subset X$ is \emph{strongly $α$-Euclidean} if there is a constant $t$ such that $t|y|\leq\|y\|\leqαt|y|$ for every $y\in Y$, and say that it is \emph{strongly $α$-complemented} if $\|P_Y\|\leqα$, where $P_Y$ is the orthogonal projection from $X$ to $Y$ and $\|P_Y\|$ denotes the operator norm of $P_Y$ with respect to the norm on $X$. We give an example of a normed space $X$ of arbitrarily high dimension that is strongly 2-Euclidean but contains no 2-dimensional subspace that is both strongly $(1+ε)$-Euclidean and strongly $(1+ε)$-complemented, where $ε>0$ is an absolute constant. This example is closely related to an old question of Vitali Milman.

math.FA

An inverse theorem for Freiman multi-homomorphisms

Let $G_1, \dots, G_k$ and $H$ be vector spaces over a finite field $\mathbb{F}_p$ of prime order. Let $A \subset G_1 \times\dots\times G_k$ be a set of size $δ|G_1| \cdots |G_k|$. Let a map $ϕ\colon A \to H$ be a multi-homomorphism, meaning that for each direction $d \in [k]$, and each element $(x_1, \dots, x_{d-1}, x_{d+1}, \dots, x_k)$ of $G_1\times\dots\times G_{d-1}\times G_{d+1}\times \dots\times G_k$, the map that sends each $y_d$ such that $(x_1, \dots,$ $x_{d-1},$ $y_d,$ $x_{d+1}, \dots,$ $x_k) \in A$ to $ϕ(x_1, \dots,$ $x_{d-1},$ $y_d,$ $x_{d+1}, \dots,$ $x_k)$ is a Freiman homomorphism (of order 2). In this paper, we prove that for each such map, there is a multiaffine map $Φ\colon G_1 \times\dots\times G_k \to H$ such that $ϕ= Φ$ on a set of density $\Big(\exp^{(O_k(1))}(O_{k,p}(δ^{-1}))\Big)^{-1}$, where $\exp^{(t)}$ denotes the $t$-fold exponential. Applications of this theorem include: $\bullet$ a quantitative inverse theorem for approximate polynomials mapping $G$ to $H$, for finite-dimensional $\mathbb{F}_p$-vector spaces $G$ and $H$, in the high-characteristic case, $\bullet$ a quantitative inverse theorem for uniformity norms over finite fields in the high-characteristic case, and $\bullet$ a quantitative structure theorem for dense subsets of $G_1 \times\dots\times G_k$ that are subspaces in the principal directions (without additional characteristic assumptions).

math.CO

The slice rank of a direct sum

We show that the slice rank of the direct sum of two tensors is equal to the sum of their slice ranks. The upper bound is trivial, but the lower bound needs more than a one-line proof, for reasons we explain. This result generalizes the fact, shown by Tao, that the slice rank of a diagonal tensor is equal to the number of non-zero entries of that tensor.

math.CO

Partial associativity and rough approximate groups

Suppose that a binary operation $\circ$ on a finite set $X$ is injective in each variable separately and also associative. It is easy to prove that $(X,\circ)$ must be a group. In this paper we examine what happens if one knows only that a positive proportion of the triples $(x,y,z)\in X^3$ satisfy the equation $x\circ(y\circ z)=(x\circ y)\circ z$. Other results in additive combinatorics would lead one to expect that there must be an underlying "group-like" structure that is responsible for the large number of associative triples. We prove that this is indeed the case: there must be a proportional-sized subset of the multiplication table that approximately agrees with part of the multiplication table of a metric group. We also present an example that suggests that our result cannot be strengthened to yield a dense subset that agrees with part of the multiplication table of a group.

math.CO

A uniform set with fewer than expected arithmetic progressions of length 4

An example is presented of a subset $A$ of $\mathbb Z_N$ of density $α$ such that the largest non-trivial Fourier coefficient of the characteristic function of $A$ is very small, but the probability that a random arithmetic progression (mod $N$) of length 4 lies in $A$ is significantly smaller than $α^4$.

math.CO

Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques

Considering a natural generalization of the Ruzsa-Szemerédi problem, we prove that for any fixed positive integers $r,s$ with $r<s$, there are graphs on $n$ vertices containing $n^{r}e^{-O(\sqrt{\log{n}})}=n^{r-o(1)}$ copies of $K_s$ such that any $K_r$ is contained in at most one $K_s$. We also give bounds for the generalized rainbow Turán problem $\operatorname{ex}(n, H,$rainbow-$F)$ when $F$ is complete. In particular, we answer a question of Gerbner, Mészáros, Methuku and Palmer, showing that there are properly edge-coloured graphs on $n$ vertices with $n^{r-1-o(1)}$ copies of $K_r$ such that no $K_r$ is rainbow.

math.CO

Improved bounds for the Erdős-Rogers function

The Erdős-Rogers function $f_{s,t}$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. While good estimates for $f_{s,t}$ are known for some pairs $(s,t)$, notably when $t=s+1$, in general there are significant gaps between the best known upper and lower bounds. We improve the upper bounds when $s+2\leq t\leq 2s-1$. For each such pair we obtain for the first time a proof that $f_{s,t}\leq n^{α_{s,t}+o(1)}$ with an exponent $α_{s,t}<1/2$, answering a question of Dudek, Retter and Rödl.

math.CO

A note on extensions of multilinear maps defined on multilinear varieties

Let $G_1, \dots, G_k$ be finite-dimensional vector spaces over a finite field $\mathbb{F}$. A multilinear variety of codimension $d$ is a subset of $G_1 \times \dots \times G_k$ defined as the zero set of $d$ forms, each of which is multilinear on some subset of the coordinates. A map $ϕ$ defined on a multilinear variety $B$ is multilinear if for each coordinate $d$ and all choices of $x_i \in G_i$, $i\not=d$, the restriction map $y \mapsto ϕ(x_1, \dots, x_{d-1}, y, x_{d+1}, \dots, x_k)$ is linear where defined. In this note, we show that a multilinear map defined on a multilinear variety of codimension $d$ coincides on a multilinear variety of codimension $d^{O(1)}$ with a multilinear map defined on the whole of $G_1\times\dots\times G_k$.

math.CO

Subsets of Cayley graphs that induce many edges

Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $η$-closed if the average degree of the subgraph induced by $A$ is at least $ηd$. This says that if we choose a random vertex $x\in A$ and a random neighbour $y$ of $x$, then the probability that $y\in A$ is at least $η$. The work of this paper was motivated by an attempt to obtain a qualitative description of closed subsets of the Cayley graph $Γ$ whose vertex set is $\mathbb F_2^{n_1}\otimes \dots \otimes \mathbb F_2^{n_d}$ with two vertices joined by an edge if their difference is of the form $u_1\otimes \cdots \otimes u_d$. For the matrix case (that is, when $d=2$), such a description was obtained by Khot, Minzer and Safra, a breakthrough that completed the proof of the 2-to-2 conjecture. In this paper, we formulate a conjecture for higher dimensions, and prove it in an important special case. Also, we identify a statement about $η$-closed sets in Cayley graphs on arbitrary finite Abelian groups that implies the conjecture and can be considered as a "highly asymmetric Balog-Szemerédi-Gowers theorem" when it holds. We conclude the paper by showing that this statement is not true for an arbitrary Cayley graph. It remains to decide whether the statement can be proved for the Cayley graph $Γ$.

math.CO

Interleaved group products

Let $G$ be the special linear group $\mathrm{SL}(2,q)$. We show that if $(a_1,\ldots,a_t)$ and $(b_1,\ldots,b_t)$ are sampled uniformly from large subsets $A$ and $B$ of $G^t$ then their interleaved product $a_1 b_1 a_2 b_2 \cdots a_t b_t$ is nearly uniform over $G$. This extends a result of the first author, which corresponds to the independent case where $A$ and $B$ are product sets. We obtain a number of other results. For example, we show that if $X$ is a probability distribution on $G^m$ such that any two coordinates are uniform in $G^2$, then a pointwise product of $s$ independent copies of $X$ is nearly uniform in $G^m$, where $s$ depends on $m$ only. Extensions to other groups are also discussed. We obtain closely related results in communication complexity, which is the setting where some of these questions were first asked by Miles and Viola. For example, suppose party $A_i$ of $k$ parties $A_1,\dots,A_k$ receives on its forehead a $t$-tuple $(a_{i1},\dots,a_{it})$ of elements from $G$. The parties are promised that the interleaved product $a_{11}\dots a_{k1}a_{12}\dots a_{k2}\dots a_{1t}\dots a_{kt}$ is equal either to the identity $e$ or to some other fixed element $g\in G$, and their goal is to determine which of the two the product is equal to. We show that for all fixed $k$ and all sufficiently large $t$ the communication is $Ω(t \log |G|)$, which is tight. Even for $k=2$ the previous best lower bound was $Ω(t)$. As an application, we establish the security of the leakage-resilient circuits studied by Miles and Viola in the "only computation leaks" model.

math.CO

A quantitative inverse theorem for the $U^4$ norm over finite fields

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 $\|f\|_{U^k}\geq c$, then there is a polynomial $π$ of degree at most $k-1$ such that $\mathbb E_xf(x)ω^{-π(x)}\geq c'$, where $ω=\exp(2πi/p)$ and $c'>0$ is a constant that depends on $c,k$ and $p$ only. A version of this result for low-characteristic was also proved by Tao and Ziegler. The proofs of these results do not yield a lower bound for $c'$. Here we give a different proof in the high-characteristic case when $k=4$, which enables us to give an explicit estimate for $c'$. The bound we obtain is roughly doubly exponential in the other parameters.

math.CO