William T. Gowers
Discrete Mathematics and Combinatorics · 2001–2023
A researcher in the Science corpus: 11 papers; trusts 23 researchers and is trusted by 98 researchers here, as inferred from the citation graph.
Subfields
- Discrete Mathematics and Combinatorics — 51 citations into it; #19 of 2,084 by trust here, #30 by citations
- Computational Theory and Mathematics — 30 citations into it; #404 of 12,489 by trust here, #1,159 by citations
- Geometry and Topology — 30 citations into it; #83 of 7,435 by trust here, #259 by citations
- Algebra and Number Theory — 20 citations into it; #48 of 2,865 by trust here, #144 by citations
Whom William T. Gowers trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ben Joseph Green
- Terence Tao
- Vojtech Rödl
- B. Host
- D. Goldston
- Julia Wolf
- T. Ziegler
- Imre Z. Ruzsa
- Mokshay M. Madiman
- Bryna Kra
Who trusts William T. Gowers overall
- Terence Tao
- Ben Joseph Green
- Ilya D. Shkredov
- David Conlon
- Peter Keevash
- T. Ziegler
- Nikos Frantzikinakis
- Tomasz Schoen
- Sophie Stevens
- Dhruv Mubayi
Papers from William T. Gowers's perspective
Ordered by how strongly the researchers William T. Gowers trusts endorse each paper. Same corpus, a different order for every researcher.
- Universal characteristic factors and Furstenberg averages
- Freiman's theorem in an arbitrary abelian group
- Foundations of a Structural Theory of Set Addition
- A NEW PROOF OF SZEMER ´ EDI'S THEOREM
- An analog of Freiman's theorem in groups (Astérisque)
- On the size of k-fold sum and product sets of integers
- The true complexity of a system of linear equations
- Nonconventional ergodic averages and nilmanifolds
- The primes contain arbitrarily long arithmetic progressions
- Linear equations in primes
Their papers
- Hypergraph regularity and the multidimensional Szemerédi theorem (2007) — 463 citations
- Decompositions, approximate structure, transference, and the Hahn–Banach theorem (2008) — 125 citations
- Combinatorial theorems in sparse random sets (2010) — 243 citations
- RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) (2001) — 580 citations
- The true complexity of a system of linear equations (2007) — 100 citations
- An infinite Ramsey theorem and some Banach-space dichotomies (2002) — 135 citations
- On the KŁR conjecture in random graphs (2013) — 80 citations
- On a conjecture of Marton (2023) — 71 citations
- Linear Forms and Higher-Degree Uniformity for Functions On $${\mathbb{F}^{n}_{p}}$$ (2010) — 72 citations
- A new proof of Szemerédi's theorem (2001) — 935 citations
- A NEW PROOF OF SZEMER ´ EDI'S THEOREM (2001) — 428 citations