PreprintCC BY 4.0arXiv
Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees
Abstract
We investigate the finite ultrametric spaces (X,d) that have a given cardinality of the center of distances and a minimal cardinality of the set X. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.
Related
- Gumbel convergence for maximal packing distances from uniform random samples
- On the Graph Corresponding to Center of Distances of Metric Space
- Distances on Finite Constraint Systems and LICQ Radii in Nonlinear Programming
- Wigner symmetries single out symmetric Wasserstein distances in all finite dimensions
- Maximal Order Type and Width of the h-Preorder on Finite Labeled Trees
BibTeX
@misc{dovgoshey2026maximal,
title = {{Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees}},
author = {Oleksiy Dovgoshey and Navjay Singh Jaiswal and Surinder Pal Singh Kainth and Gursimar Kaur and Olga Rovenska},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.11384},
eprint = {2609.11384},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11384},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees
AU - Oleksiy Dovgoshey
AU - Navjay Singh Jaiswal
AU - Surinder Pal Singh Kainth
AU - Gursimar Kaur
AU - Olga Rovenska
PY - 2026
DA - 2026/09/10
PB - arXiv
DO - 10.48550/arxiv.2609.11384
UR - https://arxiv.org/abs/2609.11384
AB - We investigate the finite ultrametric spaces (X,d) that have a given cardinality of the center of distances and a minimal cardinality of the set X. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.
ER -