T. Sanders

activity

20062026

most citedOn the Bogolyubov-Ruzsa lemma

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

collaborators

39 papers

math.CA2026

The Wiener norm of lifts of dense Sidon sets

Tom Sanders

We describe, with proof, an infinite class of examples of finite sets of integers $A$ for which $∥ 1_{A} ∥_{1} \geq (c_{R} - o_{∣ A ∣ \to \infty} (1)) ∣ A ∣$ wh…

math.CO2026

Modular Schur numbers

Tom Sanders

We study modular analogues of Schur numbers for systems of linear equations. We show that these only depend on the number of equations, not their coefficients and in the case of on…

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…

math.CO2018

The stability of finite sets in dyadic groups

Tom Sanders

We show that there is an absolute $c > 0$ such that any subset of $F_{2}^{\infty}$ of size $N$ is $O (N^{1 - c})$ -stable in the sense of Terry and Wolf. By contrast a size $N$ arit…