
Ebook Info
- Published: 1997
- Number of pages: 417 pages
- Format: PDF
- File Size: 4.97 MB
- Authors: Konrad Engel
Description
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 combinatorics. Researchers and graduate students in discrete mathematics, optimisation, algebra, probability theory, number theory, and geometry will find many powerful new methods arising from Sperner theory.
User’s Reviews
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐I ordered this book on four different occasions. Each time I ordered it I received a WWII book instead.
⭐
⭐
Keywords
Free Download Sperner Theory (Encyclopedia of Mathematics and its Applications Book 65) 1st Edition in PDF format
Sperner Theory (Encyclopedia of Mathematics and its Applications Book 65) 1st Edition PDF Free Download
Download Sperner Theory (Encyclopedia of Mathematics and its Applications Book 65) 1st Edition 1997 PDF Free
Sperner Theory (Encyclopedia of Mathematics and its Applications Book 65) 1st Edition 1997 PDF Free Download
Download Sperner Theory (Encyclopedia of Mathematics and its Applications Book 65) 1st Edition PDF
Free Download Ebook Sperner Theory (Encyclopedia of Mathematics and its Applications Book 65) 1st Edition