Sprache: Englisch
Verlag: Cambridge University Press, 1997
ISBN 10: 0521452066 ISBN 13: 9780521452069
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 169,44
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 1997
ISBN 10: 0521452066 ISBN 13: 9780521452069
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 241,35
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. Emphasises the powerful methods arising from the fusion of combinatorial techniques with programming, linear algebra, and probability theory. Series Editor(s): Rota, G.-C.; Doran, B.; Ismail, M.; Lam, T. Y.; Wutwak, E.; Flajolet, Philippe; Lutwak, E. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 432 pages, 25 b/w illus. 1 table. BIC Classification: PBCH; PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 24. Weight in Grams: 820. . 1997. hardcover. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 1997
ISBN 10: 0521452066 ISBN 13: 9780521452069
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.