T. Sanders

activity

20062026

most citedOn the Bogolyubov-Ruzsa lemma

157 citations · 642 across the 35 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019★ 4 cited

Bootstrapping partition regularity of linear systems

Tom Sanders

Suppose that $A$ is a $k \times d$ matrix of integers and write $R_{A} : N \to N \cup {\infty}$ for the function taking $r$ to the largest $N$ su…

math.CA2019

On inequivalences of sequences of characters

Tom Sanders

We establish various results including the following: if $1 < p < \infty$ and $σ$ is a bijection between the trigonometric functions on $[0, 1)$ and the Walsh functions on $[0, 1)$ . Then…

math.CO2019★ 3 cited

Schur's colouring theorem for non-commuting pairs

Tom Sanders

For G a finite non-Abelian group we write c(G) for the probability that two randomly chosen elements commute and k(G) for the largest integer such that any k(G)-colouring of G is g…