Pith. sign in

REVIEW 2 cited by

Marton's Conjecture in abelian groups with bounded torsion

Not yet reviewed by Pith; the record is open.

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 2404.02244 v2 pith:U7NRK35R submitted 2024-04-02 math.NT math.CO

Marton's Conjecture in abelian groups with bounded torsion

classification math.NT math.CO
keywords abeliantorsionboundedconjecturegroupsmartonarbitraryargument
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We prove a Freiman--Ruzsa-type theorem with polynomial bounds in arbitrary abelian groups with bounded torsion, thereby proving (in full generality) a conjecture of Marton. Specifically, let $G$ be an abelian group of torsion $m$ (meaning $mg=0$ for all $g \in G$) and suppose that $A$ is a non-empty subset of $G$ with $|A+A| \leq K|A|$. Then $A$ can be covered by at most $(2K)^{O(m^3)}$ translates of a subgroup of $H \leq G$ of cardinality at most $|A|$. The argument is a variant of that used in the case $G = \mathbf{F}_2^n$ in a recent paper of the authors.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Entropy lower bounds and sum-product phenomena

    math.CO 2026-04 unverdicted novelty 7.0

    Entropy lower bounds are established for sums and products, including a max(H(X+X'), H(XX')) bounded below by a linear function of H(X) and min-entropy of X over arbitrary fields.

  2. The Technological Turn in Mathematics

    math.HO 2026-07 conditional novelty 4.0

    AI technologies including ITPs and LLMs are transforming mathematical practice by altering proof verification, enabling trust-free large-scale collaboration, and redistributing epistemic labor between humans and machines.