English

Combinatorial properties of ultrametrics and generalized ultrametrics

Metric Geometry 2019-08-23 v1

Abstract

Let XX, YY be sets and let Φ\Phi, Ψ\Psi be mappings with domains X2X^{2} and Y2Y^{2} respectively. We say that Φ\Phi and Ψ\Psi are combinatorially similar if there are bijections f ⁣:Φ(X2)Ψ(Y2)f \colon \Phi(X^2) \to \Psi(Y^{2}) and g ⁣:YXg \colon Y \to X such that Ψ(x,y)=f(Φ(g(x),g(y)))\Psi(x, y) = f(\Phi(g(x), g(y))) for all xx, yYy \in Y. 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