REVIEW 3 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
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.
Forward citations
Cited by 3 Pith papers
-
Stabilizers and NIP arithmetic regularity
NIP sets in finite groups admit arithmetic regularity through stabilizers, with a new proof and polynomial bounds in the bounded-tripling case.
-
Entropic additive energy and entropy inequalities for sums and products
Introduces differential entropic additive energy and proves new entropy bounds for sums, products, and sum-product combinations, plus a counterexample limiting the entropic Erdős-Szemerédi phenomenon to exponent at most 1/3.
-
The Technological Turn in Mathematics
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.
Discussion (0). Continue with ORCID to comment.