Sperner theory, Vol. 65
Engel, Konrad
Sperner theory, Vol. 65 - Cambridge: Cambridge University Press, 1997. - ix; 417 p. pb; 24 cm. - Encyclopedia of mathematics and its applications .
The starting point of this book is Sperner's theorem, which answers the question: What is the maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite set? This theorem stimulated the development of a fast growing theory dealing with external problems on finite sets and, more generally, on finite partially ordered sets. This book presents Sperner theory from a unified point of view, bringing combinatorial techniques together with methods from programming, linear algebra, Lie-algebra representations and eigenvalue methods, probability theory, and enumerative.
9780521452069
Algebraic Topology
Combinatorial Set Theory
Partially Ordered Sets
Sperner Theory
511.32 ENG
Sperner theory, Vol. 65 - Cambridge: Cambridge University Press, 1997. - ix; 417 p. pb; 24 cm. - Encyclopedia of mathematics and its applications .
The starting point of this book is Sperner's theorem, which answers the question: What is the maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite set? This theorem stimulated the development of a fast growing theory dealing with external problems on finite sets and, more generally, on finite partially ordered sets. This book presents Sperner theory from a unified point of view, bringing combinatorial techniques together with methods from programming, linear algebra, Lie-algebra representations and eigenvalue methods, probability theory, and enumerative.
9780521452069
Algebraic Topology
Combinatorial Set Theory
Partially Ordered Sets
Sperner Theory
511.32 ENG
