6 papers · 1 filter
A short proof of the existence of designs
Peter Keevash
We give a new proof of the existence of designs, which is much shorter and gives better bounds.
The structure of sets with cube-avoiding sumsets
Thomas Karam, Peter Keevash
We prove that if is an integer, is a finite abelian group, is a subset of not contained in any strict coset in , and are dense subsets of…
Additive Bases: Change of Domain
Boris Bukh, Peter van Hintum, Peter Keevash
We consider two questions of Ruzsa on how the minimum size of an additive basis of a given set depends on the domain of . To state these questions, for an abelian group…
Robot Positioning Using Torus Packing for Multisets
Chung Shue Chen, Peter Keevash, Sean Kennedy +2
We consider the design of a positioning system where a robot determines its position from local observations. This is a well-studied problem of considerable practical importance an…
Dissipative particle systems on expanders
John Haslegrave, Peter Keevash
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different s…
Balanced two-type annihilation: mean-field asymptotics
John Haslegrave, Peter Keevash
We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, an…