Andrew G. Thomason

Computational Theory and Mathematics · 2004–2012

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

Subfields

• Computational Theory and Mathematics — 7 citations into it; #2,810 of 12,182 by trust here, #5,954 by citations
• Discrete Mathematics and Combinatorics — 6 citations into it; #381 of 2,017 by trust here, #640 by citations
• Geometry and Topology — 6 citations into it; #1,888 of 7,422 by trust here, #3,228 by citations

Whom Andrew G. Thomason trusts overall

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

1. Ben Joseph Green
2. Daniel Král'

Who trusts Andrew G. Thomason overall

1. Robert Morris
2. Jozsef Balogh
3. David Conlon
4. Sam Mattheus
5. Jacques Verstraëte
6. Wojciech Samotij
7. Tao-Ming Wang
8. William T. Gowers
9. David Saxton

Papers from Andrew G. Thomason's perspective

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

1. A Szemerédi-type regularity lemma in abelian groups, with applications
2. A removal lemma for systems of linear equations over finite fields
3. ON SOME NEW INEQUALITIES CONCERNING EXTREMAL PROPERTIES OF GRAPHS by
4. Hypergraph regularity and the multidimensional Szemerédi theorem
5. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
6. Universal characteristic factors and Furstenberg averages
7. Szemerédi’s Lemma for the Analyst
8. An analog of Freiman's theorem in groups (Astérisque)
9. Foundations of a Structural Theory of Set Addition
10. Freiman's theorem in an arbitrary abelian group

Their papers

• Hypergraph containers (2012) — 395 citations
• Edge weights and vertex colours (2004) — 376 citations