000			01219 a2200217 4500
999			_c52754 _d52754
008			200319b ||||| |||| 00| 0 eng d
020			_a9780521452069
082			_a511.32 ENG
100			_aEngel, Konrad
245			_aSperner theory, Vol. 65
260			_bCambridge University Press, _c1997. _aCambridge:
300			_aix; 417 p. _bpb; _c24 cm.
365			_aGBP _b92.00
440			_aEncyclopedia of mathematics and its applications
520			_aThe 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.
650			_aAlgebraic Topology
650			_aCombinatorial Set Theory
650			_aPartially Ordered Sets
650			_aSperner Theory
942			_2ddc _cTD