Cantitate/Preț
Produs

Algebraic Combinatorics: Walks, Trees, Tableaux, and More: Undergraduate Texts in Mathematics

Autor Richard P. Stanley
en Limba Engleză Hardback – 15 iun 2018
Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author’s extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound understanding to mathematical, engineering, and business models. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, de Bruijn sequences, the Erdős–Moser conjecture, electrical networks, the Sperner property, shellability of simplicialcomplexes and face rings. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees.
The new edition contains a bit more content than intended for a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Instructors may pick and choose chapters/sections for course inclusion and students can immerse themselves in exploring additional gems once the course has ended. A chapter on combinatorial commutative algebra (Chapter 12) is the heart of added material in this new edition. The author gives substantial application without requisites needed for algebraic topology and homological algebra. A sprinkling of additional exercises and a new section (13.8) involving commutative algebra, have been added.
From reviews of the first edition:
“This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics … . Stanley’s emphasis on ‘gems’ unites all this —he chooses his material to excite students and draw them into further study. … Summing Up:  Highly recommended. Upper-division undergraduates and above.” —D. V. Feldman, Choice, Vol. 51(8), April, 2014

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32191 lei  38-44 zile
  Springer International Publishing – 14 dec 2018 37996 lei  22-36 zile
  Springer – 8 iul 2015 32191 lei  38-44 zile
Hardback (1) 38716 lei  22-36 zile
  Springer International Publishing – 15 iun 2018 38716 lei  22-36 zile

Din seria Undergraduate Texts in Mathematics

Preț: 38716 lei

Nou

Puncte Express: 581

Preț estimativ în valută:
7409 7696$ 6155£

Carte disponibilă

Livrare economică 13-27 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319771724
ISBN-10: 3319771728
Pagini: 326
Ilustrații: XVI, 263 p. 87 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.58 kg
Ediția:2nd ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Undergraduate Texts in Mathematics

Locul publicării:Cham, Switzerland

Cuprins

Updated preface to the first edition.- Preface to the second edition.-Basic notation.- 1. Walks in graphs.- 2. Cubes and the Radon transform.- 3. Random walks.- 4. The Sperner property.- 5. Group actions on boolean algebras.- 6. Young diagrams and q-binomial coefficients.- 7. Enumeration under group action.- 8. A glimpse of Young tableaux.- Appendix. The RSK algorithm.- Appendix. Plane partitions.- 9. The Matrix-Tree theorem.- Appendix. Three elegant combinatorial proofs.- 10. Eulerian diagraphs and oriented trees.- 11. Cycles, bonds, and electrical networks.- 12. A glimpse of combinatorial commutative algebra.- 13. Miscellaneous gems of algebraic combinatorics.- Hints and comments.- Bibliography.- Index.

Notă biografică

Richard P. Stanley is one of the most well-known algebraic combinatorists in the world. He is currently professor of Applied Mathematics at the Massachusetts Institute of Technology. Amongst his several visiting professorships, Stanley has received numerous awards including the George Polya Prize in Applied Combinatorics, Guggenheim Fellowship, admission to both the American Academy and National Academies of Sciences, Leroy P. Steele Prize for Mathematical Exposition, Rolf Schock Prize in Mathematics, Senior Scholar at Clay Mathematics Institute, Aisenstadt Chair, Honorary Doctor of Mathematics from the University of Waterloo, and an honorary professorship at the Nankai University. Professor Stanley has had over 50 doctoral students and is well known for his excellent teaching skills.

Textul de pe ultima copertă

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author’s extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound understanding to mathematical, engineering, and business models. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, de Bruijn sequences, the Erdős–Moser conjecture, electrical networks, the Sperner property, shellability of simplicialcomplexes and face rings. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees.
The new edition contains a bit more content than intended for a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Instructors may pick and choose chapters/sections for course inclusion and students can immerse themselves in exploring additional gems once the course has ended. A chapter on combinatorial commutative algebra (Chapter 12) is the heart of added material in this new edition. The author gives substantial application without requisites needed for algebraic topology and homological algebra. A sprinkling of additional exercises and a new section (13.8) involving commutative algebra, have been added.
From reviews of the first edition:
“This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics … . Stanley’s emphasis on ‘gems’ unites all this —he chooses his material to excite students and draw them into further study. … Summing Up:  Highly recommended. Upper-division undergraduates and above.” —D. V. Feldman, Choice, Vol. 51(8), April, 2014


Caracteristici

Includes a new chapter on combinatorial commutative algebra First text on algebraic combinatorics targeted towards undergraduates Written by the most well-known algebraic combinatorist world-wide Covers topics of Walks in graphs, cubes and Radon transform, Matrix-Tree Theorem, the Sperner property, and more

Recenzii

“The chosen topicsrepresent a sample of enumerative combinatorics suitable for the elementaryalgebra available to an undergraduate student. … This is a book that can beused to teach a topics course for senior undergraduates. It will help them tosolidify their just-acquired abstract algebra and at the same it will introducethem to some beautiful topics in pure or applied combinatorics.” (FelipeZaldivar, MAA Reviews, maa.org, December, 2015)
“This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics … . Stanley’s emphasis on ‘gems’ unites all this--he chooses his material to excite students and draw them into further study. … Summing Up: Highly recommended. Upper-division undergraduates and above.” (D. V. Feldman, Choice, Vol. 51 (8), April, 2014)