On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
Pablo Candela, Bal\'azs Szegedy, Llu\'is Vena

TL;DR
This paper extends arithmetic removal lemmas and Szemerédi's theorem to all compact abelian groups using invariant measurable hypergraphs, establishing uniform bounds for linear configurations.
Contribution
It introduces a symmetry-preserving removal lemma for invariant measurable hypergraphs and applies it to generalize Szemerédi's theorem to all compact abelian groups.
Findings
Proves an arithmetic removal result for all compact abelian groups.
Establishes a symmetry-preserving removal lemma for invariant hypergraphs.
Generalizes Szemerédi's theorem with uniform bounds across all such groups.
Abstract
We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain group actions, and for these hypergraphs we prove a symmetry-preserving removal lemma, which extends a finitary result of the same name by the second author. We deduce our arithmetic removal result by applying this lemma to a specific type of invariant measurable hypergraph. As a direct application, we obtain the following generalization of Szemer\'edi's theorem: for any compact abelian group , any measurable set with Haar probability satisfies where the constant is valid uniformly for all…
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Mathematical Dynamics and Fractals
