A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces

DOI10.1016/j.jcta.2018.06.004zbMath1394.05134arXiv1709.04440OpenAlexW2964148686WikidataQ124842079 ScholiaQ124842079MaRDI QIDQ1671780

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

Publication date: 7 September 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

extremal combinatoricsadditive combinatoricsarithmetic removal lemmaarithmetic property testing

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75)

Related Items (3)

Removal lemmas and approximate homomorphisms ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings

Cites Work

• 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
• A combinatorial proof of the removal lemma for groups
• A tight bound for Green's arithmetic triangle removal lemma in vector spaces
• 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
• Testing Odd-Cycle-Freeness in Boolean Functions
• On cap sets and the group-theoretic approach to matrix multiplication
• Testing Linear-Invariant Non-linear Properties: A Short Report
• A unified framework for testing linear‐invariant properties

This page was built for publication: A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces