Enumerative combinatorics, Volume 2:
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 pr...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1999
|
| Schriftenreihe: | Cambridge studies in advanced mathematics
62 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 585 pages) |
| ISBN: | 9780511609589 |
| DOI: | 10.1017/CBO9780511609589 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043942429 | ||
| 003 | DE-604 | ||
| 005 | 20220301 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1999 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511609589 |c Online |9 978-0-511-60958-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511609589 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511609589 | ||
| 035 | |a (OCoLC)1222273699 | ||
| 035 | |a (DE-599)BVBBV043942429 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511/.62 |2 20 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Stanley, Richard P. |d 1944- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Enumerative combinatorics, Volume 2 |c Richard P. Stanley |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1999 | |
| 300 | |a 1 online resource (xii, 585 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |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 | 4 | |a Combinatorial enumeration problems | |
| 650 | 0 | 7 | |a Abzählende Kombinatorik |0 (DE-588)4132720-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Abzählende Kombinatorik |0 (DE-588)4132720-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-56069-6 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-78987-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511609589 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351399 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511609589 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511609589 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176885195735040 |
|---|---|
| any_adam_object | |
| author | Stanley, Richard P. 1944- |
| author_facet | Stanley, Richard P. 1944- |
| author_role | aut |
| author_sort | Stanley, Richard P. 1944- |
| author_variant | r p s rp rps |
| building | Verbundindex |
| bvnumber | BV043942429 |
| classification_rvk | SK 170 SK 890 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511609589 (OCoLC)1222273699 (DE-599)BVBBV043942429 |
| dewey-full | 511/.62 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.62 |
| dewey-search | 511/.62 |
| dewey-sort | 3511 262 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511609589 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02980nmm a2200481zcb4500</leader><controlfield tag="001">BV043942429</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220301 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1999 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511609589</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-60958-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511609589</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511609589</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1222273699</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942429</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.62</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stanley, Richard P.</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Enumerative combinatorics, Volume 2</subfield><subfield code="c">Richard P. Stanley</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 585 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge studies in advanced mathematics</subfield><subfield code="v">62</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial enumeration problems</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abzählende Kombinatorik</subfield><subfield code="0">(DE-588)4132720-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Abzählende Kombinatorik</subfield><subfield code="0">(DE-588)4132720-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-56069-6</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-78987-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511609589</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351399</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511609589</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511609589</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942429 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:17Z |
| institution | BVB |
| isbn | 9780511609589 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351399 |
| oclc_num | 1222273699 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xii, 585 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge studies in advanced mathematics |
| spelling | Stanley, Richard P. 1944- Verfasser aut Enumerative combinatorics, Volume 2 Richard P. Stanley Cambridge Cambridge University Press 1999 1 online resource (xii, 585 pages) txt rdacontent c rdamedia cr rdacarrier 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 Combinatorial enumeration problems Abzählende Kombinatorik (DE-588)4132720-2 gnd rswk-swf Abzählende Kombinatorik (DE-588)4132720-2 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-56069-6 Erscheint auch als Druckausgabe 978-0-521-78987-5 https://doi.org/10.1017/CBO9780511609589 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Stanley, Richard P. 1944- Enumerative combinatorics, Volume 2 Combinatorial enumeration problems Abzählende Kombinatorik (DE-588)4132720-2 gnd |
| subject_GND | (DE-588)4132720-2 |
| title | Enumerative combinatorics, Volume 2 |
| title_auth | Enumerative combinatorics, Volume 2 |
| title_exact_search | Enumerative combinatorics, Volume 2 |
| title_full | Enumerative combinatorics, Volume 2 Richard P. Stanley |
| title_fullStr | Enumerative combinatorics, Volume 2 Richard P. Stanley |
| title_full_unstemmed | Enumerative combinatorics, Volume 2 Richard P. Stanley |
| title_short | Enumerative combinatorics, Volume 2 |
| title_sort | enumerative combinatorics volume 2 |
| topic | Combinatorial enumeration problems Abzählende Kombinatorik (DE-588)4132720-2 gnd |
| topic_facet | Combinatorial enumeration problems Abzählende Kombinatorik |
| url | https://doi.org/10.1017/CBO9780511609589 |
| work_keys_str_mv | AT stanleyrichardp enumerativecombinatoricsvolume2 |