Roth-type theorems in finite groups

DOI10.1016/j.ejc.2013.05.027zbMath1292.11027arXiv1201.3670OpenAlexW2067086851MaRDI QIDQ2509729

József Solymosi

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extremal set theory (05D05) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (5)

Popular progression differences in vector spaces II ⋮ The (7, 4)-Conjecture in Finite Groups ⋮ Triforce and corners ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ SCHUR’S COLOURING THEOREM FOR NONCOMMUTING PAIRS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• A combinatorial proof of the removal lemma for groups
• On subsets of abelian groups with no 3-term arithmetic progression
• An ergodic Szemerédi theorem for commuting transformations
• A density version of a geometric Ramsey theorem
• Hypergraph regularity and the multidimensional Szemerédi theorem
• A Szemerédi-type regularity lemma in abelian groups, with applications
• On a two-dimensional analogue of Szemerédi's theorem in Abelian groups
• On sets of integers containing k elements in arithmetic progression
• A Roth theorem for amenable groups.
• Extremal problems on set systems
• Regularity Lemma for k-uniform hypergraphs
• A Note on a Question of Erdős and Graham
• Central sets and a non-commutative Roth theorem
• The counting lemma for regular k‐uniform hypergraphs
• On Certain Sets of Integers

This page was built for publication: Roth-type theorems in finite groups