A non-flag arithmetic regularity lemma and counting lemma

Daniel Altman

A non-flag arithmetic regularity lemma and counting lemma

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.14083 v1 pith:PRYD45PA submitted 2022-09-28 math.CO math.DSmath.NT

Daniel Altman This is my paper · ORCID

classification math.COmath.DSmath.NT

keywords lemmaarithmeticcountingregularityformslinearsystemsalgebraic

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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 applies to all systems of linear forms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

On polynomial progressions via transference
math.NT 2025-06 conditional novelty 8.0 of 10

For any integer polynomial P with P(0)=0, any subset of [N] avoiding x, x+P(y), ..., x+kP(y) has size at most N (log log log N)^{-c}, with stronger bounds when P'(0)!=0.

Pith tools