Sperner theory, Vol. 65
Series: Encyclopedia of mathematics and its applicationsPublication details: Cambridge University Press, 1997. Cambridge:Description: ix; 417 p. pb; 24 cmISBN:- 9780521452069
- 511.32 ENG
Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
Books | IIT Gandhinagar | General | 511.32 ENG (Browse shelf(Opens below)) | 1 | Available | 028956 |
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.
There are no comments on this title.