Abstract
Given a k-tuple P=(x 1,x 2,...,x k ) in a finite lattice X endowed with the lattice metric d, a median of P is an element m of X minimizing the sum ∑ i d(m,x i ). If X is an upper semimodular lattice, Leclerc proved that a lower bound of the medians is c(P), the majority rule and he pointed out an open problem: “Is c 1(P)=∨ i x i , the upper bound of the medians?” This paper shows that the upper bound is not c 1(P) and gives the best possible upper bound.
Similar content being viewed by others
References
Bandelt, H. J. and Barthélemy, J. P. (1984) Medians in median graphs, Discrete Appl. Math. 8, 131–142.
Bandelt, H. J. Single facility location on median networks, Math. Oper. Res., to appear.
Barbut, M. (1980) Médiane, distributivite, éloignements, Math. Sci. Humain. 70, 5–31.
Barthélemy, J. P. and Janowitz, M. F. (1991) A formal theory of consensus, SIAM J. Discrete Math. 4, 305–322.
Barthélemy, J. P., Leclerc, B. and Monjardet, B. (1986) On the use of ordered sets in problems of comparison and consensus of classification, J. Classification 3, 187–224.
Barthélemy, J. P. and Leclerc, B. (1995) The median procedure for partitions, in I. J. Cox, P. Hansen and B. Julesz (eds), Partitioning Data Sets, Amer. Math. Soc., Providence, RI, pp. 3–34.
Birkhoff, G. (1967) Lattice Theory, 3rd edn, Amer. Math. Soc., Providence, RI.
Leclerc, B. and Cucumel, G. (1987) Consensus en classification: Une revue bibliographique, Math. Sci. Humain. 100, 109–128.
Leclerc, B. (1990) Medians and majorities in semimodular lattices, SIAM J. Discrete Math. 3, 266–276.
Leclerc, B. (1998) Consensus of classifications: The case of trees, in A. Rizzi, M. Vichi and H.-H. Bock (eds), Advances in Data Sciences and Classification, Studies in Classifications, Data Analysis and Knowledge Organization, Springer-Verlag, Berlin, pp. 81–90.
McMorris, F. R. and Power, R. C. (1995) The median procedure in a formal theory of consensus, SIAM J. Discrete Math. 8, 507–516.
McMorris, F. R., Mulder, H. M. and Roberts, F. S. The median function on median graphs and median semilattices, Discrete Appl. Math., to appear.
Monjardet, B. (1981) Metrics on partially ordered sets, a survey, Discrete Math. 35, 173–184.
Monjardet, B. (1990) Comments on R. P. Dilworth's lattices with unique irreducible decompositions, in K. Bogart, R. Freese and J. Kung (eds), The Dilworth Theorems; Selected Works of Robert P. Dilworth, Birkhäuser, Boston, pp. 192–201.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, J., Boukaabar, K. Singular Points and an Upper Bound of Medians in Upper Semimodular Lattices. Order 17, 287–299 (2000). https://doi.org/10.1023/A:1026760432073
Issue Date:
DOI: https://doi.org/10.1023/A:1026760432073