On distances and metrics in discrete ordered sets
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality and restrictions of the distance to finite chains may or may not coincide with the natural, difference-of-height distance measured in a chain. It...
Main Authors: | Stephan Foldes, Sándor Radeleczki |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics of the Czech Academy of Science
2021-10-01
|
Series: | Mathematica Bohemica |
Subjects: | |
Online Access: | http://mb.math.cas.cz/full/146/3/mb146_3_2.pdf |
Similar Items
-
Relatively pseudocomplemented posets
by: Ivan Chajda, et al.
Published: (2018-04-01) -
Interval Decomposition Lattices are Balanced
by: Foldes Stephan, et al.
Published: (2016-09-01) -
Choice Overload and Height Ranking of Menus in Partially-Ordered Sets
by: Marcello Basili, et al.
Published: (2015-10-01) -
A metrizable Lawson semitopological semilattice with non-closed partial order
by: Taras Banakh, et al.
Published: (2020-10-01) -
A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite
by: Iryna Banakh, et al.
Published: (2021-01-01)