arXiv (All)
open access
Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees
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 charac
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Disconnected graphs and extremal bounds for realizable distance orders#616985
- Disconnected graphs and extremal bounds for realizable distance orders#616485
- Center Table#618325
- 20 U.S.C. § 2104 — Functions of Center#575903
- The N-5 Scaling Law: Topological Dimensionality Reduction in the Optimal Design of Fully-actuated Multirotors#1104934
Record · ID 998916
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive