Enumerative combinatorics: 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 [u.a.]
Cambridge Univ. Press
1999
|
| Schriftenreihe: | Cambridge studies in advanced mathematics
62 |
| Schlagworte: | |
| Online-Zugang: | BTU01 UBR01 Volltext |
| 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: | 1 Online-Ressource (xii, 585 Seiten) Illustrationen |
| ISBN: | 9780511609589 |
| DOI: | 10.1017/CBO9780511609589 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cc4500 | ||
|---|---|---|---|
| 001 | BV045496292 | ||
| 003 | DE-604 | ||
| 005 | 20220302 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190304s1999 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511609589 |c OnlineAusgabe |9 978-0-511-60958-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511609589 |2 doi | |
| 035 | |a (OCoLC)1089711924 | ||
| 035 | |a (DE-599)BVBBV045496292 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 |a DE-83 |a DE-634 | ||
| 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. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Enumerative combinatorics |n 2 |
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 1999 | |
| 300 | |a 1 Online-Ressource (xii, 585 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Cambridge studies in advanced mathematics |v 62 | |
| 490 | 0 | |a Cambridge studies in advanced mathematics |v ... | |
| 520 | 3 | |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 | 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 | |
| 773 | 0 | 8 | |w (DE-604)BV042221716 |g 2 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-56069-6 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-78987-5 |
| 830 | 0 | |a Cambridge studies in advanced mathematics |v 62 |w (DE-604)BV044781283 |9 62 | |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511609589 |x Verlag |3 Volltext |
| 912 | |a ZDB-20-CBO |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030881057 | ||
| 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 BTU01 |p ZDB-20-CBO |q BTU_PDA_CBO_Kauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511609589 |l UBR01 |p ZDB-20-CBO |q UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804179426299084800 |
|---|---|
| any_adam_object | |
| author | Stanley, Richard P. |
| author_facet | Stanley, Richard P. |
| author_role | aut |
| author_sort | Stanley, Richard P. |
| author_variant | r p s rp rps |
| building | Verbundindex |
| bvnumber | BV045496292 |
| classification_rvk | SK 170 SK 890 |
| collection | ZDB-20-CBO ebook |
| ctrlnum | (OCoLC)1089711924 (DE-599)BVBBV045496292 |
| 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>02987nmm a2200469 cc4500</leader><controlfield tag="001">BV045496292</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220302 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190304s1999 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511609589</subfield><subfield code="c">OnlineAusgabe</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">(OCoLC)1089711924</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045496292</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-355</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-634</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="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Enumerative combinatorics</subfield><subfield code="n">2</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 585 Seiten)</subfield><subfield code="b">Illustrationen</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="1" ind2=" "><subfield code="a">Cambridge studies in advanced mathematics</subfield><subfield code="v">62</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge studies in advanced mathematics</subfield><subfield code="v">...</subfield></datafield><datafield tag="520" ind1="3" 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="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="773" ind1="0" ind2="8"><subfield code="w">(DE-604)BV042221716</subfield><subfield code="g">2</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</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">Druck-Ausgabe</subfield><subfield code="z">978-0-521-78987-5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge studies in advanced mathematics</subfield><subfield code="v">62</subfield><subfield code="w">(DE-604)BV044781283</subfield><subfield code="9">62</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="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030881057</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">BTU01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BTU_PDA_CBO_Kauf</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">UBR01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBR Einzelkauf (Lückenergänzung CUP Serien 2018)</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV045496292 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:19:40Z |
| institution | BVB |
| isbn | 9780511609589 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030881057 |
| oclc_num | 1089711924 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR DE-83 DE-634 |
| owner_facet | DE-355 DE-BY-UBR DE-83 DE-634 |
| physical | 1 Online-Ressource (xii, 585 Seiten) Illustrationen |
| psigel | ZDB-20-CBO ebook ZDB-20-CBO BTU_PDA_CBO_Kauf ZDB-20-CBO UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| series | Cambridge studies in advanced mathematics |
| series2 | Cambridge studies in advanced mathematics |
| spelling | Stanley, Richard P. Verfasser aut Enumerative combinatorics 2 Cambridge [u.a.] Cambridge Univ. Press 1999 1 Online-Ressource (xii, 585 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Cambridge studies in advanced mathematics 62 Cambridge studies in advanced mathematics ... 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. Abzählende Kombinatorik (DE-588)4132720-2 gnd rswk-swf Abzählende Kombinatorik (DE-588)4132720-2 s 1\p DE-604 (DE-604)BV042221716 2 Erscheint auch als Druck-Ausgabe 978-0-521-56069-6 Erscheint auch als Druck-Ausgabe 978-0-521-78987-5 Cambridge studies in advanced mathematics 62 (DE-604)BV044781283 62 https://doi.org/10.1017/CBO9780511609589 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Stanley, Richard P. Enumerative combinatorics Cambridge studies in advanced mathematics Abzählende Kombinatorik (DE-588)4132720-2 gnd |
| subject_GND | (DE-588)4132720-2 |
| title | Enumerative combinatorics |
| title_auth | Enumerative combinatorics |
| title_exact_search | Enumerative combinatorics |
| title_full | Enumerative combinatorics 2 |
| title_fullStr | Enumerative combinatorics 2 |
| title_full_unstemmed | Enumerative combinatorics 2 |
| title_short | Enumerative combinatorics |
| title_sort | enumerative combinatorics |
| topic | Abzählende Kombinatorik (DE-588)4132720-2 gnd |
| topic_facet | Abzählende Kombinatorik |
| url | https://doi.org/10.1017/CBO9780511609589 |
| volume_link | (DE-604)BV042221716 (DE-604)BV044781283 |
| work_keys_str_mv | AT stanleyrichardp enumerativecombinatorics2 |