Home Science A unified abstract regularity lemma
Science

A unified abstract regularity lemma

Key Points

Combinatorics [Submitted on 4 Jun 2026] Title:A unified abstract regularity lemma View PDF HTML (experimental)Abstract:The goal of this short note is to prove a unified abstract regularity lemma which recovers Szemerédi's graph regularity lemma, Green's arithmetic regularity lemma, and a regularity lemma for Boolean functions as direct corollaries. Current browse context: math.

Mathematics > Combinatorics [Submitted on 4 Jun 2026] Title:A unified abstract regularity lemma View PDF HTML (experimental)Abstract:The goal of this short note is to prove a unified abstract regularity lemma which recovers Szemerédi's graph regularity lemma, Green's arithmetic regularity lemma, and a regularity lemma for Boolean functions as direct corollaries. Current browse context: math.CO References & Citations Loading... Bibliographic and Citation Tools Bibliographic Explorer (What is the Explorer?) Connected Papers (What is Connected Papers?) Litmaps (What is Litmaps?) scite Smart Citations (What are Smart Citations?) Code, Data and Media Associated with this Article alphaXiv (What is alphaXiv?) CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub (What is DagsHub?) Gotit.pub (What is GotitPub?) Hugging Face (What is Huggingface?) ScienceCast (What is ScienceCast?) Demos Recommenders and Search Tools Influence Flower (What are Influence Flowers?) CORE Recommender (What is CORE?) arXivLabs: experimental projects with community collaborators Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Szemerédi (ORG) Green (ORG) Boolean (ORG) CO References & Citations Loading (ORG) Bibliographic (PERSON) Data (ORG) Media Associated (ORG) DagsHub (PERSON) Gotit.pub (PERSON) Huggingface (ORG) Demos Recommenders (PERSON) CORE Recommender (ORG) CORE (ORG) arXiv (ORG)
Originally published by arXiv CS Read original →