19 citations · 41 across the 9 of their papers we have counts for
12 papers
A parallel wakeup problem and multi-room light switch strategies
John Haslegrave, Paul A. Russell, Mark Walters
The wakeup problem in distributed computing asks for a symmetric protocol that enables one of several processors to eventually guarantee that all (or, in a more general setting, en…
Inhomogeneous Partition Regularity
Imre Leader, Paul A. Russell
We say that the system of equations , where is an integer matrix and is a (non-zero) integer vector, is partition regular if whenever the integers are finitely colour…
Infinite monochromatic sumsets for colourings of the reals
Péter Komjáth, Imre Leader, Paul A. Russell +3
N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of so that no infinite sumset is monochromatic…
Monochromatic infinite sumsets
Imre Leader, Paul A. Russell
We show that there is a rational vector space such that, whenever is finitely coloured, there is an infinite set whose sumset is monochromatic. Our example is the…
Set Systems Containing Many Maximal Chains
J. Robert Johnson, Imre Leader, Paul A. Russell
The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size…
Probably Intersecting Families are Not Nested
Paul A. Russell, Mark Walters
It is well known that an intersecting family of subsets of an n-element set can contain at most 2^(n-1) sets. It is natural to wonder how `close' to intersecting a family of size g…