A non-flag arithmetic regularity lemma and counting lemma

Abstract Green and Tao’s arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the ‘flag condition’. We give an arithmetic regularity lemma and counting lemma which apply to all systems of linear forms.

Authors

Institutions

Publication Details

Journal
Compositio Mathematica
Published
2025-03-01
DOI
https://doi.org/10.1112/s0010437x24007693
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A non-flag arithmetic regularity lemma and counting lemma

Daniel Altman
Compositio Mathematica
Limits and Structures in Graph Theory
article

A non-flag arithmetic regularity lemma and counting lemma

Daniel Altman
article en

Abstract

Abstract Green and Tao’s arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the ‘flag condition’. We give an arithmetic regularity lemma and counting lemma which apply to all systems of linear forms.

Compositio MathematicaVol. 161(3)
Stanford University (US)
Openalex Percentile: Top 78%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A non-flag arithmetic regularity lemma and counting lemma — Daniel Altman · Compositio Mathematica (2025) | TGRS Research Map | TGRS