Combinatorial properties of ultrametrics and generalized ultrametrics
Metric Geometry
2019-08-23 v1
Abstract
Let , be sets and let , be mappings with domains and respectively. We say that and are combinatorially similar if there are bijections and such that for all , . Conditions under which a given mapping is combinatorially similar to an ultrametric or a pseudoultrametric are found. Combinatorial characterizations are also obtained for poset-valued ultrametric distances recently defined by Priess-Crampe and Ribenboim.
Keywords
Cite
@article{arxiv.1908.08349,
title = {Combinatorial properties of ultrametrics and generalized ultrametrics},
author = {O. Dovgoshey},
journal= {arXiv preprint arXiv:1908.08349},
year = {2019}
}
Comments
41 pages, 2 figures