Marton’s conjecture in abelian groups with bounded torsion

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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> be an abelian group of torsion <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>m</mml:mi> </mml:math> (meaning <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>m</mml:mi> <mml:mi>g</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> for all <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>g</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>G</mml:mi> </mml:mrow> </mml:math> ) and suppose that <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>A</mml:mi> </mml:math> is a non-empty subset of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mo>+</mml:mo> <mml:mi>A</mml:mi> <mml:mo>|</mml:mo> <mml:mo>≤</mml:mo> <mml:mi>K</mml:mi> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mo>|</mml:mo> </mml:mrow> </mml:math> . Then <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>A</mml:mi> </mml:math> can be covered by at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>2</mml:mn> <mml:mi>K</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mi>m</mml:mi> <mml:mn>3</mml:mn> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:msup> </mml:math> translates of a subgroup <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>H</mml:mi> <mml:mo>≤</mml:mo> <mml:mi>G</mml:mi> </mml:mrow> </mml:math> of cardinality at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mo>|</mml:mo> </mml:mrow> </mml:math> . The argument is a variant of that used in the case <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>=</mml:mo> <mml:msubsup> <mml:mi mathvariant="bold">F</mml:mi> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msubsup> </mml:mrow> </mml:math> in a recent paper of the authors.

Authors

Institutions

Publication Details

Journal
Annales de la faculté des sciences de Toulouse Mathématiques
Published
2026-01-13
DOI
https://doi.org/10.5802/afst.1839
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

Marton’s conjecture in abelian groups with bounded torsion

T. Tao, Freddie Manners, W. Timothy Gowers, Ben J. Green
Annales de la faculté des sciences de Toulouse Mathématiques
Limits and Structures in Graph Theory
article

Marton’s conjecture in abelian groups with bounded torsion

T. Tao, Freddie Manners, W. Timothy Gowers, Ben J. Green
article en

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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> be an abelian group of torsion <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>m</mml:mi> </mml:math> (meaning <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>m</mml:mi> <mml:mi>g</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> for all <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>g</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>G</mml:mi> </mml:mrow> </mml:math> ) and suppose that <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>A</mml:mi> </mml:math> is a non-empty subset of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mo>+</mml:mo> <mml:mi>A</mml:mi> <mml:mo>|</mml:mo> <mml:mo>≤</mml:mo> <mml:mi>K</mml:mi> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mo>|</mml:mo> </mml:mrow> </mml:math> . Then <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>A</mml:mi> </mml:math> can be covered by at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>2</mml:mn> <mml:mi>K</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mi>m</mml:mi> <mml:mn>3</mml:mn> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:msup> </mml:math> translates of a subgroup <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>H</mml:mi> <mml:mo>≤</mml:mo> <mml:mi>G</mml:mi> </mml:mrow> </mml:math> of cardinality at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mo>|</mml:mo> </mml:mrow> </mml:math> . The argument is a variant of that used in the case <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>=</mml:mo> <mml:msubsup> <mml:mi mathvariant="bold">F</mml:mi> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msubsup> </mml:mrow> </mml:math> in a recent paper of the authors.

Annales de la faculté des sciences de Toulouse MathématiquesVol. 35(1)
APLA Health (US), Collège de France (FR), University of California San Diego (US), Mathematical Institute of the Slovak Academy of Sciences (SK)
Openalex Percentile: Top 88%
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.