Les hiérarchies de parties et leur demi-treillis
Mathématiques et sciences humaines, Tome 89 (1985), pp. 5-34.
corrigé par Errata : « Les hiérarchies de parties et leur demi-treillis » 
@article{MSH_1985__89__5_0,
     author = {Leclerc, Bruno},
     title = {Les hi\'erarchies de parties et leur demi-treillis},
     journal = {Math\'ematiques et sciences humaines},
     pages = {5--34},
     publisher = {Ecole Pratique des hautes \'etudes, Centre de math\'ematique sociale et de statistique},
     volume = {89},
     year = {1985},
     mrnumber = {800206},
     zbl = {0563.68060},
     language = {fr},
     url = {http://www.numdam.org/item/MSH_1985__89__5_0/}
}
TY  - JOUR
AU  - Leclerc, Bruno
TI  - Les hiérarchies de parties et leur demi-treillis
JO  - Mathématiques et sciences humaines
PY  - 1985
SP  - 5
EP  - 34
VL  - 89
PB  - Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
UR  - http://www.numdam.org/item/MSH_1985__89__5_0/
LA  - fr
ID  - MSH_1985__89__5_0
ER  - 
%0 Journal Article
%A Leclerc, Bruno
%T Les hiérarchies de parties et leur demi-treillis
%J Mathématiques et sciences humaines
%D 1985
%P 5-34
%V 89
%I Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
%U http://www.numdam.org/item/MSH_1985__89__5_0/
%G fr
%F MSH_1985__89__5_0
Leclerc, Bruno. Les hiérarchies de parties et leur demi-treillis. Mathématiques et sciences humaines, Tome 89 (1985), pp. 5-34. http://www.numdam.org/item/MSH_1985__89__5_0/

Bandelt H.J., Barthelemy J.P., "Medians in median graphs", Discrete Applied Math., 8 (1984), 131-142. | MR | Zbl

Bandelt H.J., Hedlikova J., "Median Algebras", Discrete Math., 45 (1983), 1-30. | MR | Zbl

Barbut M., "Mediane, distributivité, éloignements" (1961), Math. Sci. hum., 70 (1980), 5-31. | Numdam | MR | Zbl

Barbut M., Monjardet B., Ordre et classification. Algèbre et Combinatoire, Paris, Hachette, 1970. | Zbl

Barthelemy J.P., "Remarques sur les propriétés métriques des ensembles ordonnés", Math. Sci. hum., 61 (1978), 39-60. | Numdam | MR | Zbl

Barthelemy J.P., "Caractérisations axiomatiques de la distance de la différence symétrique entre les relations binaires", Math. Sci. hum., 67 (1979), 85-113. | Numdam | Zbl

Barthelemy J.P., Leclerc B., Monjardet B., "Quelques aspects du consensus en classification", in : DIDAY E., et al., eds, Data Analysis and Informatics 3, Amsterdam, North-Holland, 1984a, 307-316. | MR | Zbl

Barthelemy J.P., Leclerc B., Monjardet B., "Ensembles ordonnés et taxonomie mathématique", in : POUZET M., RICHARD D., eds, Orders : description and roles, Amsterdam, North-Holland, 1984b, 523-548. | MR | Zbl

Benzecri J.P., "Description mathématique des classifications"(1967), in : L'analyse des données I, La Taxinomie, Paris, Dunod, 1973. | MR

Berge C., Graphes et hypergraphes, Paris, Dunod, 1970. Graphs and hypergraphs, Amsterdam, North-Holland, 1973. | MR | Zbl

Boorman S.A., Olivier D.C., "Metrics on spaces of finite trees", J. Math. Psychol., 10 (1973), 26-59. | MR | Zbl

Brown E.K., Day W.H.E., "A computationally Efficient Approximation to the Nearest Neighbour Interchange Metric", J. of Classification 1 (1984), 93-124. | MR | Zbl

Cayley A., "On the theory of the analytic forms called trees", Phil. Magazine, XIII, (1857), 172-176. Collected mathematical papers, vol.3, p.242, Cambridge University Press.

Chandon J.L., Pinson S., Analyse typologique, Paris, Masson, 1980. | MR | Zbl

Comtet L., Analyse combinatoire, Paris, Presses Universitaires de France, 1970a. Advanced Combinatorics, Dordrecht, Reidel, 1974.

Comtet L., "Sur le quatrième problème et les nombres de Schröder", C.R. Acad. Sci. Paris A-271 (1970 b) 913-916. | MR | Zbl

Comyn G., Van Dorpe J.C., "Valuation et semi-modularité dans les demi-treillis", Math. Sci. hum., 56 (1976), 63-75. | Numdam | MR | Zbl

Dobson A.J., "Unrooted trees for numerical taxonomy", J. Appl. Prob., 11 (1974), 32-42. | MR | Zbl

Etherington I.M.H., "On non-associative combinations", Proc. Roy. Soc. Edinburgh, 59 (1939), 153-162. | JFM | Zbl

Flament C., Leclerc B., "Arbres minimaux d'un graphe préordonné", Discrete Math., 46 (1983), 159-171. | MR | Zbl

Foulds L.R., Robinson R.W., "Determining the asymptotic number of phylogenetic trees", in : Combinatorial Mathematics VII, Lecture Notes in Mathematics 829, Berlin, Springer-Verlag, 1980. | MR | Zbl

Foulds L.R., Robinson R.W., "Enumeration of binary phylogenetic trees", in : Combinatorical Mathematics VIII, Lecture Notes in Mathematics 884, Berlin, Springer-Verlag, 1982. | Zbl

Gardner M., "Mathematical games : Catalan numbers", Scientific American 235, (June 1976), 120-125.

Gould H., "Research bibliography of two special numbers sequences", Mathematica Monongaliae, 12 (1971). | MR | Zbl

Guilbaud G. Th., "Un problème leibnitzien : les partages en nombres entiers", Math. Sci. hum., 17 (1968), 13-36. | Numdam | MR

Guilbaud G.Th., Rosenstiehl P., "Analyse algébrique d'un scrutin", Math. Sci. hum., 4 (1960), 9-33. | Numdam

Harary F., Graph Theory, Reading, Mass., Addison-Wesley, 1969. | MR | Zbl

Harary F., Mowshowitz A., Riordan J., "Labelled trees with unlabelled endpoints", J. Comb. Theory, 6 (1969), 60-64. | MR | Zbl

Harding E.S., "The probabilities of rooted tree-shapes generated by random bifurcations", Adv. Appl. Prob., 3 (1971), 44-77. | MR | Zbl

Hartigan J.A., Clustering algorithms, New-York, Wiley, 1975. | MR | Zbl

Haskins L., Gudder S., "Height on posets and graphs", Discrete Math., 2, (1972), 357-382. | MR | Zbl

Jarvis J.P., Luedeman J.K., Shier D.R., "Counterexamples in Measuring the distance between binary trees", Mathematical Social Sciences, 4 (1983), 271-274. | Zbl

Knuth D.E., The art of computer programming, vol. 1 : Fundamental algorithms, vol.3 : Sorting and searching, Reading, Mass., Addison-Wesley, 1969- 1973. | MR

Leclerc B., "Description combinatoire des ultramétriques", Math. Sci. hum., 73 (1981), 5-37. | Numdam | MR | Zbl

Leclerc B., Description, évaluation et comparaison des hiérarchies de parties, rapport CAMS-EHESS, 1982.

Lerman I.C., Les bases de la classification mathématique, Paris, Gauthier-Villars, 1970. | MR | Zbl

Lerman I.C., Classification et analyse ordinale des données, Paris, Dunod, 1981. | MR | Zbl

Margush T., M F.R., "Consensus n-trees", Bull. Math. Biology, 43 (1981), 239-244. | MR | Zbl

Monjardet B., "Caractérisations métriques des ensembles ordonnés semimodulaires", Math. Sci. hum., 56 (1976), 77-87. | Numdam | MR | Zbl

Monjardet B., "Metrics on a partially ordered set. A survey", Discrete Math., 35 (1981), 173-181. | MR | Zbl

Moon J.W., "Enumerating labelled trees", in : HARARY F., ed., Graph Theory and Theoretical Physics, London, Academic Press, 1967. | MR | Zbl

Moore G.W., Goodman M., Barnabas J., "An iterative approach from the stand-point of the additive hypothesis to the dendrogram problem posed by molecular data sets", J. Theor. Biol., 38 (1973), 423-457.

Murtagh F., "Counting dendrograms : a survey", Discrete Applied Math., 7 (1984), 191-199. | MR | Zbl

Ore O., "Chains in partially ordered sets", Bull. Amer. Math. Soc., 49 (1943), 558-566. | MR | Zbl

Otter R., "The number of trees", Ann. Math., 49, n°3 (1948), 583-599. | MR | Zbl

Robinson D.F., "Comparison of Labeled Trees with valency three", J. of Comb. Theory 11 (1971), 105-119. | MR | Zbl

Rosenstiehl P., "L'arbre minimum d'un graphe", in : ROSENSTIEHL P., ed., Théorie des graphes (Rome, 1966), Paris, Dunod, 1967. | Zbl

Schader M., "Hierarchical analysis : classification with ordinal object dissimilarities", Metrika, 27 (1980), 127-132. | MR | Zbl

Schader M., Scharfe und unscharfe Klassifikation Qualitativer Daten, Mathematic Systems in Economics 65, Verlagsgruppe Athenanüm, 1981. | MR | Zbl

Sholander M., "Medians, Lattices and Trees", Proc. Amer. Math. Soc., 5 (1954), 808-812. | MR | Zbl

Schröder E., "Vier combinatorische probleme", S. fur Mat. Phys., 15 (1870), 361-376. | JFM

Sloane N.J.A., A handbook of integer sequences, New-York, Academic Press, 1973. | MR | Zbl

Waterman M.S., Smith T.F., "On the similarity of dendrograms", J. Theor. Biol. 73 (1978), 789-800. | MR

Wedderburn J.H., "The functional equation g(x2) = 2x + [g(x)]2", Ann. Math., 24 (1922), 121-140. | JFM | MR