Is the space of reachable particle configurations dense?
Combinatorics
2025-07-31 v1
Abstract
Let be a finite sequence of points in an Euclidean space . Suppose that there is a (pointlike) particle sitting at each point . In a ``legal'' move, any one of them can jump over another, landing on the other side, at exactly the same distance. Under what circumstances can we guarantee that for any and any other sequence of points , there is a finite sequence of legal moves that takes the particle at to the -neighborhood of , simultaneously for every ? We prove that this is possible if and only if the additive group generated by the vectors is dense in .
Cite
@article{arxiv.2507.22471,
title = {Is the space of reachable particle configurations dense?},
author = {Janos Pach and Gabor Tardos},
journal= {arXiv preprint arXiv:2507.22471},
year = {2025}
}
Comments
12 pages, 0 figures