A tight bound for Green's arithmetic triangle removal lemma in vector spaces

DOI10.1016/j.aim.2017.09.037zbMath1391.11048arXiv1606.01230OpenAlexW2763468056WikidataQ124827290 ScholiaQ124827290MaRDI QIDQ1673988

Jacob Fox, László Miklós Lovász

Publication date: 30 October 2017

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01230

zbMATH Keywords

additive combinatoricspolynomial methodarithmetic removal lemmasubspace sampling

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Related Items (12)

Popular progression differences in vector spaces II ⋮ On an almost all version of the Balog-Szemeredi-Gowers theorem ⋮ Removal lemmas and approximate homomorphisms ⋮ Fast Property Testing and Metrics for Permutations ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Sets Avoiding Six-Term Arithmetic Progressions in $\mathbb{Z}_6^{n}$ are Exponentially Small ⋮ A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces ⋮ Local-vs-global combinatorics ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ A DISTRIBUTION ON TRIPLES WITH MAXIMUM ENTROPY MARGINAL ⋮ The structure of claw-free binary matroids

Cites Work

• Unnamed Item
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• A new proof of the graph removal lemma
• Matrix multiplication via arithmetic progressions
• A combinatorial proof of the removal lemma for groups
• Lower bounds for testing triangle-freeness in Boolean functions
• Sunflowers and testing triangle-freeness of functions
• A Szemerédi-type regularity lemma in abelian groups, with applications
• An Arithmetic Analogue of Fox's Triangle Removal Argument
• Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
• Testing Odd-Cycle-Freeness in Boolean Functions
• Sublinear Time Algorithms
• On cap sets and the group-theoretic approach to matrix multiplication
• Proof of a conjecture of Kleinberg-Sawin-Speyer
• Testing Linear-Invariant Non-linear Properties: A Short Report
• A unified framework for testing linear‐invariant properties

This page was built for publication: A tight bound for Green's arithmetic triangle removal lemma in vector spaces