| Description |
1 online resource (ix, 417 pages) : illustrations. |
| Physical Medium |
polychrome |
| Description |
text file |
| Series |
Encyclopedia of mathematics and its applications ; volume 65
|
|
Encyclopedia of mathematics and its applications ; volume 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. |
| Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
| Subject |
Sperner theory.
|
|
Sperner theory. |
|
Partially ordered sets.
|
|
Partially ordered sets. |
| Genre/Form |
Electronic books.
|
| Other Form: |
Print version: Engel, Konrad, 1956- Sperner theory 0521452066 (DLC) 96020967 (OCoLC)34730719 |
| ISBN |
9781107088641 (electronic book) |
|
110708864X (electronic book) |
|
0521452066 |
|
9780521452069 |
|
