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

This publication has 11 references indexed in Scilit:

• A tight bound for Green's arithmetic triangle removal lemma in vector spaces
  Advances in Mathematics, 2017
• Progression-free sets in $\mathbb{Z}_4^n$ are exponentially small
  Annals of Mathematics, 2017
• On large subsets of $\mathbb{F}_q^n$ with no three-term arithmetic progression
  Annals of Mathematics, 2017
• Sunflowers and Testing Triangle-Freeness of Functions
  computational complexity, 2016
• Lower bounds for testing triangle-freeness in Boolean functions
  computational complexity, 2014
• Guest column
  ACM SIGACT News, 2013
• A unified framework for testing linear‐invariant properties
  Random Structures & Algorithms, 2013
• Testing Odd-Cycle-Freeness in Boolean Functions
  Combinatorics, Probability and Computing, 2012
• A new proof of the graph removal lemma
  Annals of Mathematics, 2011
• A Szemerédi-type regularity lemma in abelian groups, with applications
  Geometric and Functional Analysis, 2005