Roth type theorems in finite groups
Jozsef Solymosi
TL;DR
This paper extends Roth type theorems to finite groups using combinatorial tools, specifically the Triangle Removal Lemma, to analyze arithmetic progressions in algebraic structures.
Contribution
It introduces finite group analogs of Roth theorems and applies the Triangle Removal Lemma to establish these results.
Findings
Proves Roth type theorems in finite groups
Utilizes Triangle Removal Lemma in algebraic context
Establishes new combinatorial bounds for progressions
Abstract
We prove Roth type theorems in finite groups. Our main tool is the Triangle Removal Lemma of Ruzsa and Szemer\'edi.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · graph theory and CDMA systems