Finite Ordered Sets Concepts, Results and Uses

Abstract : Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. We present the first book to dealing exclusively with finite ordered sets. Five chapters are devoted to definitions of key concepts and fundamental results (ranked orders, Dilworth's and Sperner's theorem, Galois connection and residuation, duality between orders and distributive lattices, coding and dimension theory). The last - and larger - chapter presents uses of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints or references provided for the most difficult ones. We also point to further topics of ongoing research. At last there are appendices devoted to algorithmic complexity, documentation marks, types and numbers of ordered sets, about 500 references, a list of symbols and a (substantial) index.
Complete list of metadatas

https://halshs.archives-ouvertes.fr/halshs-00800193
Contributor : Bernard Monjardet <>
Submitted on : Wednesday, March 13, 2013 - 12:55:07 PM
Last modification on : Wednesday, November 6, 2019 - 10:50:21 AM

Identifiers

  • HAL Id : halshs-00800193, version 1

Collections

Citation

Nathalie Caspard, Bruno Leclerc, Bernard Monjardet. Finite Ordered Sets Concepts, Results and Uses. Cambridge University Press, pp.337, 2012. ⟨halshs-00800193⟩

Share

Metrics

Record views

484