Tom Sanders

464 total citations
24 papers, 183 citations indexed

About

Tom Sanders is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics. According to data from OpenAlex, Tom Sanders has authored 24 papers receiving a total of 183 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Discrete Mathematics and Combinatorics, 15 papers in Geometry and Topology and 9 papers in Computational Theory and Mathematics. Recurrent topics in Tom Sanders's work include Limits and Structures in Graph Theory (21 papers), Advanced Topology and Set Theory (12 papers) and Advanced Graph Theory Research (8 papers). Tom Sanders is often cited by papers focused on Limits and Structures in Graph Theory (21 papers), Advanced Topology and Set Theory (12 papers) and Advanced Graph Theory Research (8 papers). Tom Sanders collaborates with scholars based in United Kingdom, United States and Slovakia. Tom Sanders's co-authors include Ben Green, Imre Z. Ruzsa and Ben Green and has published in prestigious journals such as SHILAP Revista de lepidopterología, Annals of Mathematics and Mathematical Proceedings of the Cambridge Philosophical Society.

In The Last Decade

Tom Sanders

23 papers receiving 155 citations

Peers

Tom Sanders

DMC

CTM

GT

ANT

EEE

Ernie Croot United States

Bridget Eileen Tenner United States

Benjamin Green United States

Lê Anh Vinh Vietnam

Tamar Ziegler Israel

Juanjo Rué Spain

Randall McCutcheon United States

Tomasz Schoen Poland

Christian Stump Germany

Stéphane Launois United Kingdom

Ernie Croot United States

Tom Sanders

100 ×0.7

DMC

69 ×0.9

CTM

55 ×0.8

GT

40 ×0.8

ANT

31 ×0.9

EEE

Citations per year, relative to Tom Sanders Tom Sanders (= 1×) peers Ernie Croot

Countries citing papers authored by Tom Sanders

Since Specialization

Citations

This map shows the geographic impact of Tom Sanders's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tom Sanders with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tom Sanders more than expected).

Fields of papers citing papers by Tom Sanders

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tom Sanders. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tom Sanders. The network helps show where Tom Sanders may publish in the future.

Co-authorship network of co-authors of Tom Sanders

This figure shows the co-authorship network connecting the top 25 collaborators of Tom Sanders. A scholar is included among the top collaborators of Tom Sanders based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tom Sanders. Tom Sanders is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Sanders, Tom. (2020). Bootstrapping partition regularity of linear systems. Proceedings of the Edinburgh Mathematical Society. 63(3). 630–653. 2 indexed citations

2.

Sanders, Tom. (2019). SCHUR’S COLOURING THEOREM FOR NONCOMMUTING PAIRS. Bulletin of the Australian Mathematical Society. 100(3). 446–452. 1 indexed citations

3.

Sanders, Tom. (2018). Boolean functions with small spectral norm, revisited. Mathematical Proceedings of the Cambridge Philosophical Society. 167(2). 335–344. 2 indexed citations

4.

Green, Ben & Tom Sanders. (2016). Monochromatic sums and products. SHILAP Revista de lepidopterología. 10 indexed citations

5.

Sanders, Tom. (2016). Solvingxz=y²in Certain Subsets of Finite Groups. The Quarterly Journal of Mathematics. 2 indexed citations

6.

Sanders, Tom. (2016). A Freıman-type theorem in locally compact abelian groups.

7.

Sanders, Tom. (2013). Terence Tao: “Higher Order Fourier Analysis”. 115(3-4). 207–209. 1 indexed citations

8.

Sanders, Tom. (2012). On the Bogolyubov–Ruzsa lemma. Analysis & PDE. 5(3). 627–655. 54 indexed citations

9.

Sanders, Tom. (2011). A Quantitative Version of the Non-Abelian Idempotent Theorem. Geometric and Functional Analysis. 21(1). 141–221. 9 indexed citations

10.

Sanders, Tom. (2010). Popular difference sets. 1–4. 4 indexed citations

11.

Sanders, Tom. (2010). On a theorem of Shkredov. 1–4. 2 indexed citations

12.

Sanders, Tom. (2010). Green's sumset problem at density one half. Acta Arithmetica. 146(1). 91–101. 9 indexed citations

13.

Sanders, Tom. (2009). Indicator functions in the Fourier-Eymard algebra. arXiv (Cornell University). 2 indexed citations

14.

Sanders, Tom. (2009). From polynomial growth to metric balls in monomial groups. arXiv (Cornell University). 9(10). e106752–e106752. 4 indexed citations

15.

Sanders, Tom. (2009). Three-term arithmetic progressions and sumsets. Proceedings of the Edinburgh Mathematical Society. 52(1). 211–233. 6 indexed citations

16.

Sanders, Tom. (2008). Appendix to ‘Roth’s theorem on progressions revisited,’ by J. Bourgain. Journal d Analyse Mathématique. 104(1). 193–206. 13 indexed citations

17.

Ruzsa, Imre Z. & Tom Sanders. (2008). Difference sets and the primes. Acta Arithmetica. 131(3). 281–301. 11 indexed citations

18.

Sanders, Tom. (2007). Another proof of a Freiman-type theorem. arXiv (Cornell University). 2 indexed citations

19.

Sanders, Tom. (2007). The `1-norm of the Fourier transform on compact vector spaces. Oxford University Research Archive (ORA) (University of Oxford). 1 indexed citations

20.

Sanders, Tom. (2007). The Littlewood-Gowers problem. Journal d Analyse Mathématique. 101(1). 123–162. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact