000 | 03122nam a22003497a 4500 | ||
---|---|---|---|
003 | OSt | ||
005 | 20250508154252.0 | ||
008 | 250508b |||||||| |||| 00| 0 hin d | ||
020 | _a9783031916496 | ||
040 |
_aNISER LIBRARY _beng _cNISER LIBRARY |
||
082 |
_a519.165 _bSTA-A |
||
100 | 1 | _aStanley, Richard P. | |
245 | 1 | 0 |
_aAlgebraic combinatorics : _bwalks, trees, tableaux, and more |
250 | _a2nd edition | ||
260 |
_aCham, Switzerland : _bSpringer, _c2018. |
||
300 |
_axvi, 263 pages : _billustrations |
||
490 |
_aUndergraduate texts in mathematics, _x0172-6056 |
||
504 | _aIncludes bibliographical references and index | ||
520 | _aWritten 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. | ||
650 | _aCombinatorial analysis | ||
650 | _aMatrix-Tree theorem | ||
650 | _aRadon transform | ||
650 | _aSperner property | ||
650 | _aAlgebraic combinatorics | ||
650 | _aCombinatorial commutative algebra | ||
650 | _aEulerian digraphs | ||
650 | _aHadamard matrices | ||
650 | _aFisher inequality | ||
856 |
_3Table of contents _uhttps://link.springer.com/content/pdf/bfm:978-3-319-77173-1/1 |
||
856 |
_3Reviews _uhttps://www.goodreads.com/book/show/46025764-algebraic-combinatorics?ref=nav_sb_ss_1_13#CommunityReviews |
||
942 |
_2udc _cN |
||
999 |
_c36032 _d36032 |