4 citations · 11 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.MA2013★ 2 cited
A variant of the multi-agent rendezvous problem
Peter Hegarty, Anders Martinsson, Dmitry Zhelezov
The classical multi-agent rendezvous problem asks for a deterministic algorithm by which points scattered in a plane can move about at constant speed and merge at a single poin…
math.NT2013
Product sets cannot contain long arithmetic progressions
Dmitry Zhelezov
Let be a set of natural numbers of size . We prove that the length of the longest arithmetic progression contained in the product set cannot…