EREADIAN

Enumerative Combinatorics: Volume 2

Паперова, 2023, 788 с. Cambridge University Press
Revised second volume of the standard guide to enumerative combinatorics, including the theory of symmetric functions and 159 new exercises. Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and 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 and focusing on combinatorics, especially the Robinson–Schensted–Knuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the Littlewood–Richardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.

Деталі

Видання
Cambridge University Press, 2023, м’яка палітурка
Видавництво
Cambridge University Press
Сторінок
788
Мова
Англійська
ISBN
9781009262484

Ціни

Паперова, 1 пропозиція
В наявності в 1 магазині
Yakaboo
4 283 ₴

Відгуки

Enumerative Combinatorics:Volume 2

Ще ніхто не оцінив.

Паперова, 2023, 788 с. Cambridge University Press

Про книжку

Revised second volume of the standard guide to enumerative combinatorics, including the theory of symmetric functions and 159 new exercises.

Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and 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 and focusing on combinatorics, especially the Robinson–Schensted–Knuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the Littlewood–Richardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.

Деталі

Видання
Cambridge University Press, 2023, паперова
Видавництво
Cambridge University Press
Сторінок
788
Мова
Англійська
ISBN
9781009262484

Відгуки

Відгуків ще немає.

Ціни 1 пропозиція

ВиданняCambridge University Press, 2023
Yakaboo
В наявності
4 283 ₴

Деякі посилання на магазини — партнерські, ми можемо отримати невеликий відсоток від магазину, але це не впливає на порядок пропозицій на сайті.

Помітили неправильну ціну?