My Library

University LibraryCatalogue

For faster,
Use Lean
Get it now
Don't show me again
Limit search to items available for borrowing or consultation
Result Page: Previous Next
Can't find that book? Try BONUS+
Look for full text

Search Discovery

Search CARM Centre Catalogue

Search Trove

Add record to RefWorks

Cover Art
Author Engel, Konrad, 1956-

Title Sperner theory / Konrad Engel.

Published Cambridge ; New York : Cambridge University Press, 1997.


Location Call No. Status
Physical description ix, 417 pages : illustrations ; 25 cm.
Series Encyclopedia of mathematics and its applications ; v. 65.
Encyclopedia of mathematics and its applications ; v. 65.
Bibliography Includes bibliographical references (pages 395-412) and index.
Contents 1. Introduction -- 2. Extremal problems for finite sets -- 3. Profile-polytopes for set families -- 4. The flow-theoretic approach in Sperner theory -- 5. Matchings, symmetric chain orders, and the partition lattice -- 6. Algebraic methods in Sperner theory -- 7. Limit theorems and asymptotic estimates -- 8. Macaulay posets.
Summary 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.
Subject Sperner theory.
Partially ordered sets.
ISBN 0521452066 (hardback)