Erweiterte
Suche ›

Eulerian Numbers

Springer New York,
Buch
64,19 € Lieferbar in 2-3 Tagen
Dieses Produkt ist auch verfügbar als:

Kurzbeschreibung

This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane arrangements, polytopes, and simplicial complexes. Some topics include a thorough discussion of gamma-nonnegativity and real-rootedness for Eulerian polynomials, as well as the weak order and the shard intersection order of the symmetric group.The book also includes a parallel story of Catalan combinatorics, wherein the Eulerian numbers are replaced with Narayana numbers. Again there is a progression from combinatorics to geometry, including discussion of the associahedron and the lattice of noncrossing partitions.The final chapters discuss how both the Eulerian and Narayana numbers have analogues in any finite Coxeter group, with many of the same enumerative and geometric properties. There are four supplemental chapters throughout, which survey more advanced topics, including some open problems in combinatorial topology. This textbook will serve a resource for experts in the field as well as for graduate students and others hoping to learn about these topics for the first time.

Details
Schlagworte
Autor

Titel: Eulerian Numbers
Autoren/Herausgeber: T. Kyle Petersen
Aus der Reihe: Birkhäuser Advanced Texts Basler Lehrbücher
Ausgabe: 1st ed. 2015

ISBN/EAN: 9781493930906

Seitenzahl: 456
Format: 23,5 x 15,5 cm
Produktform: Hardcover/Gebunden
Gewicht: 1,002 g
Sprache: Englisch

T. Kyle Petersen is an Associate Professor of Mathematics at DePaul University, Chicago, USA.  His research areas include algebraic, enumerative, and topological combinatorics.  He received his PhD in Mathematics from Brandeis University.

buchhandel.de - Newsletter
Möchten Sie sich für den Newsletter anmelden?


Bitte geben Sie eine gültige E-Mail-Adresse ein.
Lieber nicht