Kod: 04399181
This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating fun ... więcej
Wpisz swój adres e-mail, aby otrzymać od nas powiadomienie,
gdy książka będzie dostępna. Proste, prawda?
This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.
Kategoria Książki po angielsku Mathematics & science Mathematics Combinatorics & graph theory
Od roku 2008 obsłużyliśmy wielu miłośników książek, ale dla nas każdy był tym wyjątkowym.
Copyright! ©2008-24 libristo.pl Wszelkie prawa zastrzeżonePrywatnieCookies
Dobre na wszystkich stronach
Koszyk ( pusty )