Robinson spaces and their representation in low-dimensional metric spaces
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914347420221440 |
|---|---|
| author | Arrepol, Francisco Soto-Gomez, Mauricio Caro, Christopher Thraves |
| author_facet | Arrepol, Francisco Soto-Gomez, Mauricio Caro, Christopher Thraves |
| contents | Robinson spaces are structures equipped with a total order that encodes comparative dissimilarity relationships.
We study the problem of representing Robinson dissimilarity spaces into low-dimensional metric spaces. These representations aim to preserve the relative dissimilarity relationships between elements rather than their exact values. While low dimensional Euclidean spaces such as $\mathbb{R}^1$ and $\mathbb{R}^2$ are natural candidates for such embeddings, previous work has shown that not all Robinson spaces admit a valid embedding in the real line that respects their structural constraints. Motivated by this limitation, we explore the broader class of real trees, which retain low-dimensional interpretability while allowing greater flexibility.
To address the embedding problem, we develop two key tools: a combinatorial representation of Robinson spaces and a topological characterization of caterpillars, a restricted class of real trees. These tools enable a formulation of the embedding problem as a linear program, providing both computational and theoretical insights. We prove that some subclasses of Robinson spaces always admit embeddings in a caterpillar, and we establish the existence of Robinson spaces that cannot be embedded in any real tree. These results clarify the geometric limitations of representing ordered dissimilarity structures and open new directions for studying the interaction between dissimilarity, order, and metric geometry. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_21023 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Robinson spaces and their representation in low-dimensional metric spaces Arrepol, Francisco Soto-Gomez, Mauricio Caro, Christopher Thraves Combinatorics 68R12, 90C90, 52-08 Robinson spaces are structures equipped with a total order that encodes comparative dissimilarity relationships. We study the problem of representing Robinson dissimilarity spaces into low-dimensional metric spaces. These representations aim to preserve the relative dissimilarity relationships between elements rather than their exact values. While low dimensional Euclidean spaces such as $\mathbb{R}^1$ and $\mathbb{R}^2$ are natural candidates for such embeddings, previous work has shown that not all Robinson spaces admit a valid embedding in the real line that respects their structural constraints. Motivated by this limitation, we explore the broader class of real trees, which retain low-dimensional interpretability while allowing greater flexibility. To address the embedding problem, we develop two key tools: a combinatorial representation of Robinson spaces and a topological characterization of caterpillars, a restricted class of real trees. These tools enable a formulation of the embedding problem as a linear program, providing both computational and theoretical insights. We prove that some subclasses of Robinson spaces always admit embeddings in a caterpillar, and we establish the existence of Robinson spaces that cannot be embedded in any real tree. These results clarify the geometric limitations of representing ordered dissimilarity structures and open new directions for studying the interaction between dissimilarity, order, and metric geometry. |
| title | Robinson spaces and their representation in low-dimensional metric spaces |
| topic | Combinatorics 68R12, 90C90, 52-08 |
| url | https://arxiv.org/abs/2602.21023 |