On arithmetic progressions in symmetric sets in finite field model
From MaRDI portal
Publication:2200438
DOI10.37236/9242zbMath1468.11038arXiv1811.09947OpenAlexW2945294276MaRDI QIDQ2200438
Publication date: 21 September 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09947
Cites Work
- Unnamed Item
- 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 combinatorial proof of the removal lemma for groups
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- A removal lemma for systems of linear equations over finite fields
- A density version of the Hales-Jewett theorem
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- Noise correlation bounds for uniform low degree functions
- Gaussian bounds for noise correlation of resilient functions
- Lower bounds for testing triangle-freeness in Boolean functions
- On reverse hypercontractivity
- Gaussian bounds for noise correlation of functions
- Independent sets in graph powers are almost contained in juntas
- Hypergraph regularity and the multidimensional Szemerédi theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
- Normal Approximation and Asymptotic Expansions
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- Kneser graphs are like Swiss cheese
- The growth rate of tri-colored sum-free sets
- Proof of a conjecture of Kleinberg-Sawin-Speyer
- [https://portal.mardi4nfdi.de/wiki/Publication:4645045 Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics]
- Regularity Lemma for k-uniform hypergraphs
- A DISTRIBUTION ON TRIPLES WITH MAXIMUM ENTROPY MARGINAL
- A lower bound for the k‐multicolored sum‐free problem in Zmn
- The counting lemma for regular k‐uniform hypergraphs
- On restricted arithmetic progressions over finite fields
- On Certain Sets of Integers
- A new proof of Szemerédi's theorem
This page was built for publication: On arithmetic progressions in symmetric sets in finite field model
