Roth-type theorems in finite groups

DOI10.1016/J.EJC.2013.05.027MaRDI QIDQ2509729zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: We prove Roth type theorems in finite groups. Our main tool is the Triangle Removal Lemma of Ruzsa and Szemer'edi.

Recommendations

• A combinatorial proof of the removal lemma for groups
• Solvingxz=y²in Certain Subsets of Finite Groups
• An Erdős-Fuchs type theorem for finite groups
• Central sets and a non-commutative Roth theorem
• Three-term arithmetic progressions and sumsets

Cites work

• A combinatorial proof of the removal lemma for groups
• A density version of a geometric Ramsey theorem
• A new proof of the graph removal lemma
• A Note on a Question of Erdős and Graham
• A Roth theorem for amenable groups.
• A Szemerédi-type regularity lemma in abelian groups, with applications
• An ergodic Szemerédi theorem for commuting transformations
• Central sets and a non-commutative Roth theorem
• Extremal problems on set systems
• scientific article; zbMATH DE number 981680 (Why is no real title available?)
• scientific article; zbMATH DE number 3160373 (Why is no real title available?)
• scientific article; zbMATH DE number 3523855 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On a two-dimensional analogue of Szemerédi's theorem in Abelian groups
• On Certain Sets of Integers
• On sets of integers containing k elements in arithmetic progression
• On subsets of abelian groups with no 3-term arithmetic progression
• Regularity Lemma for k-uniform hypergraphs
• The counting lemma for regular k‐uniform hypergraphs

Cited in

(7)

• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Triforce and corners
• Popular progression differences in vector spaces II
• Schur's colouring theorem for noncommuting pairs
• Euler class groups and a theorem of Roitman
• The (7, 4)-Conjecture in Finite Groups
• Combinatorics. Abstracts from the workshop held January 4--9, 2026

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509729)