國立高雄大學圖資館 |

Language: English

Back

Enumerative combinatoricsVolume 2

Record Type:	Electronic resources : Monograph/item
Title/Author:	Enumerative combinatoricsRichard P. Stanley ; with an appendix by Sergey Fomin.
Author:	Stanley, Richard P.,
Published:	Cambridge, United Kingdom ;Cambridge University Press,2024.
Description:	xvi, 738 p. :ill., digital ;25 cm.
Notes:	Title from publisher's bibliographic system (viewed on 01 Aug 2023).
Subject:	Combinatorial enumeration problems.
Online resource:	https://doi.org/10.1017/9781009262538
ISBN:	9781009262538

Enumerative combinatoricsVolume 2
Stanley, Richard P.,1944-

Enumerative combinatoricsVolume 2[electronic resource] /Richard P. Stanley ; with an appendix by Sergey Fomin. - Second edition. - Cambridge, United Kingdom ;Cambridge University Press,2024. - xvi, 738 p. :ill., digital ;25 cm. - Cambridge studies in advanced mathematics ;208. - Cambridge studies in advanced mathematics ;105..

Title from publisher's bibliographic system (viewed on 01 Aug 2023).

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.

ISBN: 9781009262538Subjects--Topical Terms:

190930
Combinatorial enumeration problems.

LC Class. No.: QA164.8 / .S73 2024

Dewey Class. No.: 511.62

Enumerative combinatoricsVolume 2
LDR:02039nmm a2200289 a 4500 001 662048
003 UkCbUP
005 20230801022042.0
006 m d
007 cr nn 008maaau
008 241120s2024 enk o 1 0 eng d
020 $a 9781009262538 $q (electronic bk.)
020 $a 9781009262491 $q (hardback)
020 $a 9781009262484 $q (paperback)
035 $a CR9781009262538
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 0 0 $a QA164.8 $b .S73 2024
082 0 0 $a 511.62 $2 23
090 $a QA164.8 $b .S788 2024
100 1 $a Stanley, Richard P., $d 1944- $3 209704
245 1 0 $a Enumerative combinatorics $n Volume 2 $h [electronic resource] / $c Richard P. Stanley ; with an appendix by Sergey Fomin.
250 $a Second edition.
260 $a Cambridge, United Kingdom ; $a New York, NY : $b Cambridge University Press, $c 2024.
300 $a xvi, 738 p. : $b ill., digital ; $c 25 cm.
490 1 $a Cambridge studies in advanced mathematics ; $v 208
500 $a Title from publisher's bibliographic system (viewed on 01 Aug 2023).
520 $a 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.
650 0 $a Combinatorial enumeration problems. $3 190930
830 0 $a Cambridge studies in advanced mathematics ; $v 105. $3 541725
856 4 0 $u https://doi.org/10.1017/9781009262538