Geodesic
On distances and metrics in discrete ordered sets
Mathematica Bohemica, Tome 146 (2021) no. 3, pp. 251-262
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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 is shown that for semilattices the semimodularity ensures the good behaviour of the distances considered. The Jordan-Dedekind chain condition, which is weaker than semimodularity, is equivalent to the basic criterion that the graph-theoretic distance (realized by zig-zagging up and down freely in the poset to connect two points) is compatible with distances measured on chains by the relative height. Semimodularity is shown to be equivalent to the validity of the triangle inequality of a restricted graph-theoretic distance, called the up-down distance. The fact that the up-down distance corresponds to the computation of degrees of kinship in family trees leads to the observation that the less familiar canon-law method of computation corresponds also to a mathematically well behaved Chebyshev-type distance on discrete semilattices. For the Chebyshev distance also semimodularity is shown to imply the validity of the triangle inequality. The reverse implication fails, but assuming the validity of the triangle inequality, the semimodularity is shown to have a local characterization by a forbidden six-element subsemilattice. Like in the classical case of real spaces, the Chebyshev semilattice distance is shown to be the limit of a converging sequence of distances, all of them verifying the triangle inequality if the semilattice is semimodular.
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 is shown that for semilattices the semimodularity ensures the good behaviour of the distances considered. The Jordan-Dedekind chain condition, which is weaker than semimodularity, is equivalent to the basic criterion that the graph-theoretic distance (realized by zig-zagging up and down freely in the poset to connect two points) is compatible with distances measured on chains by the relative height. Semimodularity is shown to be equivalent to the validity of the triangle inequality of a restricted graph-theoretic distance, called the up-down distance. The fact that the up-down distance corresponds to the computation of degrees of kinship in family trees leads to the observation that the less familiar canon-law method of computation corresponds also to a mathematically well behaved Chebyshev-type distance on discrete semilattices. For the Chebyshev distance also semimodularity is shown to imply the validity of the triangle inequality. The reverse implication fails, but assuming the validity of the triangle inequality, the semimodularity is shown to have a local characterization by a forbidden six-element subsemilattice. Like in the classical case of real spaces, the Chebyshev semilattice distance is shown to be the limit of a converging sequence of distances, all of them verifying the triangle inequality if the semilattice is semimodular.
DOI : 10.21136/MB.2020.0096-19
Classification : 05C05, 06A06, 06A07, 06A12, 06C10
Keywords: poset; semilattice; tree; semimodularity; chain condition; height; distance; metric; triangle inequality 
@article{10_21136_MB_2020_0096_19,
     author = {Foldes, Stephan and Radeleczki, S\'andor},
     title = {On distances and metrics in discrete ordered sets},
     journal = {Mathematica Bohemica},
     pages = {251--262},
     year = {2021},
     volume = {146},
     number = {3},
     doi = {10.21136/MB.2020.0096-19},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2020.0096-19/}
}
TY  - JOUR
AU  - Foldes, Stephan
AU  - Radeleczki, Sándor
TI  - On distances and metrics in discrete ordered sets
JO  - Mathematica Bohemica
PY  - 2021
SP  - 251
EP  - 262
VL  - 146
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2020.0096-19/
DO  - 10.21136/MB.2020.0096-19
LA  - en
ID  - 10_21136_MB_2020_0096_19
ER  - 
%0 Journal Article
%A Foldes, Stephan
%A Radeleczki, Sándor
%T On distances and metrics in discrete ordered sets
%J Mathematica Bohemica
%D 2021
%P 251-262
%V 146
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2020.0096-19/
%R 10.21136/MB.2020.0096-19
%G en
%F 10_21136_MB_2020_0096_19
Foldes, Stephan; Radeleczki, Sándor. On distances and metrics in discrete ordered sets. Mathematica Bohemica, Tome 146 (2021) no. 3, pp. 251-262. doi: 10.21136/MB.2020.0096-19

[1] Bouchard, C. B.: Consanguinity and noble marriages in the tenth and eleventh centuries. Speculum 56 (1981), 268-287. | DOI

[2] Burtsell, R.: Canonical adoption. The Catholic Encyclopedia Vol. 1 Robert Appleton Company, New York (1907). Available at http://www.newadvent.org/cathen/01147b.htm

[3] Chartrand, G., Johns, G. L., Tian, S., Winters, S. J.: Directed distance in digraphs: Centers and medians. J. Graph Theory 17 (1993), 509-521. | DOI | MR | JFM

[4] Deza, M. M., Panteleeva, E.: Quasi-semi-metrics, oriented multi-cuts and related polyhedra. Eur. J. Comb. 21 (2000), 777-795. | DOI | MR | JFM

[5] Foldes, S., Woodroofe, R.: Antichain cutsets of strongly connected posets. Order 30 (2013), 351-361. | DOI | MR | JFM

[6] Garner, B. A.: A Dictionary of Modern Legal Usage. Oxford University Press, Oxford (2001).

[7] Haskins, L., Gudder, S.: Height on posets and graphs. Discrete Math. 2 (1972), 357-382. | DOI | MR | JFM

[8] Kharat, V. S., Waphare, B. N., Thakare, N. K.: On forbidden configurations for strong posets. Algebra Univers. 51 (2004), 111-124. | DOI | MR | JFM

[9] Monjardet, B.: Metrics on partially ordered sets--A survey. Discrete Math. 35 (1981), 173-184. | DOI | MR | JFM

Cité par Sources :