Finite Ordered Sets: Concepts, Results and Uses

Cambridge University Press, 26.01.2012
Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications 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 provided for some of the most difficult examples. The authors also point to further topics of ongoing research.

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.


A About algorithmic complexity
B The 58 types of connected ordered sets of size at most 5
C The numbers of ordered sets and of types of ordered sets
D Documentation marks
List of symbols

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Über den Autor (2012)

Nathalie Caspard is an Assistant Professor in the Laboratoire d'Algorithmique, Complexité et Logique (LACL) at Université Paris Est.

Bruno Leclerc is an Honorary Member of the Centre d'Analyse et de Mathématique Sociales of the École des Hautes Études en Sciences Sociales (School of High Studies in Social Sciences) in Paris, and of the CNRS.

Bernard Monjardet is Emeritus Professor at the Université Paris 1 Panthéon-Sorbonne.

Bibliografische Informationen