東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Enumerative combinatorics.. Volume 2

Stanley, Richard P., (1944-)

FindBook

Google Book

Amazon

博客來

Enumerative combinatorics.. Volume 2

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Enumerative combinatorics./ Richard P. Stanley.
作者:	Stanley, Richard P.,
出版者:	Cambridge :Cambridge University Press, : 1999.,
面頁冊數:	xii, 585 p. :ill., digital ;24 cm.
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Combinatorial enumeration problems. -
電子資源:	https://doi.org/10.1017/CBO9780511609589
ISBN:	9780511609589

Enumerative combinatorics.. Volume 2
Stanley, Richard P.,1944-

Enumerative combinatorics.Volume 2[electronic resource] /Richard P. Stanley. - Cambridge :Cambridge University Press,1999. - xii, 585 p. :ill., digital ;24 cm. - Cambridge studies in advanced mathematics ;62. - Cambridge studies in advanced mathematics ;62..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

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.

ISBN: 9780511609589Subjects--Topical Terms:

706042
Combinatorial enumeration problems.

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

Dewey Class. No.: 511.62

Enumerative combinatorics.. Volume 2
LDR:01968nmm a2200277 a 4500 001 2227153
003 UkCbUP
005 20160526164221.0
006 m d
007 cr nn 008maaau
008 210414s1999 enk o 1 0 eng d
020 $a 9780511609589 $q (electronic bk.)
020 $a 9780521560696 $q (hardback)
020 $a 9780521789875 $q (paperback)
035 $a CR9780511609589
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA164.8 $b .S73 1999
082 0 4 $a 511.62 $2 20
090 $a QA164.8 $b .S787 1999
100 1 $a Stanley, Richard P., $d 1944- $3 698411
245 1 0 $a Enumerative combinatorics. $n Volume 2 $h [electronic resource] / $c Richard P. Stanley.
260 $a Cambridge : $b Cambridge University Press, $c 1999.
300 $a xii, 585 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cambridge studies in advanced mathematics ; $v 62
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 $a 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.
650 0 $a Combinatorial enumeration problems. $3 706042
830 0 $a Cambridge studies in advanced mathematics ; $v 62. $3 3470415
856 4 0 $u https://doi.org/10.1017/CBO9780511609589