Usuario: guest
No has iniciado sesión
No has iniciado sesión
Type: Inproceedings
On prescribing total orders for bipartite sets of distances in the Euclidean plane
Book Title: XII Latin American Algorithms, Gaphs and Optimization Symposium (LAGOS 2023)
Editor: Cristina Fernandes; Sergio Rajsbaum
Abstract:
In this note we give a negative answer to a question proposed by Almendra-Hernández and Martínez-Sandoval. Let n ? m be positive integers and let X and Y be sets of sizes n and m in Rn-1 such that X U Y is in generic position. There is a natural order on X x Y induced by the distances between the corresponding points. The question is if all possible orders on X x Y can be obtained in this way. We show that the answer is negative when n < m. The case n=m remains open.
In this note we give a negative answer to a question proposed by Almendra-Hernández and Martínez-Sandoval. Let n ? m be positive integers and let X and Y be sets of sizes n and m in Rn-1 such that X U Y is in generic position. There is a natural order on X x Y induced by the distances between the corresponding points. The question is if all possible orders on X x Y can be obtained in this way. We show that the answer is negative when n < m. The case n=m remains open.
Keywords: Euclidean distances||Total orders||Convex sets
MSC: 52C10 (06A06)
Publisher: Elsevier
Journal: Procedia Computer Science
ISSN: 1877-0509
Year: 2023
Volume: 223
Pages: 28-34
MR Number: 4742586
Revision: 1


Autores Institucionales Asociados a la Referencia: