On a conjecture of Marton

J. Aaronson, A counterexample to a strong variant of the polynomial Freiman–Ruzsa conjecture , preprint available at https://arxiv.org/abs/1902.00353

Original

1902

Earlier work this paper cites.

H. Plünnecke, Eine zahlentheoretische Anwendung der Graphtheorie , J. reine angew. Math. 243

1970

Earlier work this paper cites.

V. A. Kaimanovich and A. M. Vershik, Random walks on discrete groups: boundary and entropy , Ann. Probab. 11

1983

Earlier work this paper cites.

I. Z. Ruzsa, An analog of Freiman’s theorem in groups , Astérisque 258

1999

Earlier work this paper cites.

J. Bourgain and M.- C. Chang, On the size of k k -fold sum and product sets of integers, J. Amer. Math. Soc. 17

2004

Earlier work this paper cites.

B. J. Green, Finite field models in additive combinatorics, in Surveys in Combinatorics 2005 London Math. Soc. Lecture Notes 327

2005

Earlier work this paper cites.

T. C. Tao, Szemerédi’s regularity lemma revisited , Contrib. Discrete Math. 1

2006

Earlier work this paper cites.

T. C. Tao and V. Vu, Additive combinatorics, Cambridge Stud. Adv. Math., 105 Cambridge University Press, Cambridge, 2006, xviii+512 pp

2006

Earlier work this paper cites.

A. Samorodnitsky, Low-degree tests at large distances, In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 506–515

2007

Earlier work this paper cites.

S. Konyagin, On the Freiman theorem in finite fields , Math. Notes 84

2008

Earlier work this paper cites.

M. Madiman, On the entropy of sums , in Information Theory Workshop 2008. ITW ’08. IEEE: 303–307, 2008

2008

Earlier work this paper cites.

M. C. Chang, Some consequences of the polynomial Freiman–Ruzsa conjecture , C. R. Math. Acad. Sci. Paris 347

2009

Cited alongside, same era.

H. Diao, Freiman–Ruzsa-type theory for small doubling constant , Math. Proc. Cambridge Philos. Soc. 146

2009

Cited alongside, same era.

B. J. Green, T. C. Tao, Freiman’s theorem in finite fields via extremal set theory , Combin. Probab. Comput. 18

2009

Cited alongside, same era.

I. Z. Ruzsa, Sumsets and structure , Adv. Courses Math. CRM Barcelona, Birkhäuser Verlag, Basel, 2009, 87–210

2009

Cited alongside, same era.

by same author, Sumsets and entropy, Random Struct. Alg., 34

2009

Cited alongside, same era.

by same author, Poincaré’s legacies, pages from year two of a mathematical blog. Part I. American Mathematical Society, 2009

S. Lovett, Equivalence of polynomial conjectures in additive combinatorics , Combinatorica 32

2012

Later among the works it cites.

T. Sanders, On the Bogolyubov–Ruzsa Lemma, Analysis and PDE 5

2012

Later among the works it cites.

by same author, The structure theory of set addition revisited, Bull. Amer. Math. Soc. 50

2013

Later among the works it cites.

by same author, An Exposition of Sanders’ Quasi-Polynomial Freiman–Ruzsa Theorem , Theory of Computing Library Graduate Surveys 6

2015

Later among the works it cites.

S. Lovett and O. Regev, A counterexample to a strong variant of the polynomial Freiman-Ruzsa conjecture in Euclidean space , Discrete Anal. 2017

2017

Later among the works it cites.

F. Manners, Finding a low-dimensional piece of a set of integers , Int. Math. Res. Not. IMRN 2017