RecordDetails
Cambridge ; New York : Cambridge University Press, 1997.
ix, 417 pages : illustrations ; 25 cm.

This book presents Sperner theory from a unified point of view, bringing combinatorial techniques together with methods from programming (flow theory and polyhedral combinatorics), from linear algebra (Jordan decompositions, Lie-algebra representations and eigenvalue methods), from probability theory (limit theorems), and from enumerative combinatorics (Mobius inversion). Researchers in discrete mathematics, optimization, algebra, probability theory, number theory, and geometry will find many powerful new methods arising from Sperner theory.