When all permutations are combinatorial similarities
From MaRDI portal
Recommendations
Cites work
- A contraction principle in semimetric spaces
- A Metric Characterization of Zero-Dimensional Spaces
- Betweenness relation and isometric imbeddings of metric spaces
- Combinatorial characterization of pseudometrics
- Combinatorial properties of ultrametrics and generalized ultrametrics
- Fixed points and Cauchy sequences in semimetric spaces
- scientific article; zbMATH DE number 3869258 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Minimal universal metric spaces
- On functions preserving regular semimetrics and quasimetrics satisfying the relaxed polygonal inequality
- On quasisymmetric mappings in semimetric spaces
- On regular semimetric spaces having strong triangle functions
- On Semi-Metric Spaces
- Properties of distance spaces with power triangle inequalities
- Quasi-ultrametrics and their \(2\)-ball hypergraphs
- Semigroups generated by partitions
- Strongly Rigid Metrics and Zero Dimensionality
- Ultrametric preserving functions and weak similarities of ultrametric spaces
- Uniqueness of best proximity pairs and rigidity of semimetric spaces
- Weak similarities of finite ultrametric and semimetric spaces
- Weak similarities of metric and semimetric spaces
Cited in
(7)- How often are two permutations comparable?
- On characterizations and topology of regular semimetric spaces
- Pseudometric spaces: from minimality to maximality in the groups of combinatorial self-similarities
- On the closure of one point sets in T₀-spaces
- Forbidden four cycle, star graphs and isometric embeddings
- Hausdorff distance between ultrametric balls
- Answers to a question on fixed point existence in regular semimetric spaces with strong triangle functions
This page was built for publication: When all permutations are combinatorial similarities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091026)
