Discrete subsets of R2 and the associated distance sets
A. Iosevich, I. Laba
math.COarXiv:math/0203162
Abstract
We prove that a well-distributed subset of R2 can have a separated distance set only if the distance is induced by a polygon.
Create a lesson
Related papers
2-large sets are sets of nil-Bohr recurrence
Ryan Alweiss, Sohail Farhangi
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar et al.
The (km,kn)-square paths theorem
Dun Qiu, Minhao Zhang
Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph
Joseph Natal, Oleksiy Al-saadi