Ernie Croot

Discrete Mathematics and Combinatorics · 2007–2017

A researcher in the Science corpus: 4 papers; trusts 10 researchers and is trusted by 6 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 30 citations into it; #749 of 2,017 by trust here, #640 by citations
• Geometry and Topology — 23 citations into it; #3,412 of 7,422 by trust here, #3,358 by citations
• Algebra and Number Theory — 14 citations into it
• Computational Theory and Mathematics — 11 citations into it; #11,500 of 12,182 by trust here, #11,946 by citations

Whom Ernie Croot trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Ben Joseph Green
2. William T. Gowers
3. Ehud Hrushovski
4. None None
5. Jean Bourgain
6. Terence Tao
7. Imre Z. Ruzsa
8. Tom Sanders
9. Mei-Chu Chang
10. Noga Alon

Who trusts Ernie Croot overall

1. Tom Sanders
2. Emmanuel Breuillard
3. Terence Tao
4. Noga Alon
5. Ben Joseph Green
6. Olof Sisask
7. Tomasz Schoen
8. Thomas F. Bloom

Papers from Ernie Croot's perspective

Ordered by how strongly the researchers Ernie Croot trusts endorse each paper. Same corpus, a different order for every researcher.

1. Freiman's theorem in an arbitrary abelian group
2. Foundations of a Structural Theory of Set Addition
3. Stable group theory and approximate subgroups
4. The Probabilistic Method
5. A new proof of the density Hales-Jewett theorem
6. A new proof of Szemerédi's theorem
7. The primes contain arbitrarily long arithmetic progressions
8. A NEW PROOF OF SZEMER ´ EDI'S THEOREM
9. Roth’s theorem on progressions revisited
10. Growth and generation in SL_2(Z/pZ)

Their papers

• Open problems in additive combinatorics (2007) — 70 citations
• Progression-free sets in $\mathbb Z_4^n$ are exponentially small (2017) — 80 citations
• Progression-free sets in Z_4^n are exponentially small (2016) — 150 citations
• A Probabilistic Technique for Finding Almost-Periods of Convolutions (2010) — 122 citations