000			03772nam a22004455i 4500
001			978-1-4614-6998-8
003			DE-He213
005			20140220082827.0
007			cr nn 008mamaa
008			130618s2013 xxu| s |||| 0|eng d
020			_a9781461469988 _9978-1-4614-6998-8
024	7		_a10.1007/978-1-4614-6998-8 _2doi
050		4	_aQA164-167.2
072		7	_aPBV _2bicssc
072		7	_aMAT036000 _2bisacsh
082	0	4	_a511.6 _223
100	1		_aStanley, Richard P. _eauthor.
245	1	0	_aAlgebraic Combinatorics _h[electronic resource] : _bWalks, Trees, Tableaux, and More / _cby Richard P. Stanley.
264		1	_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2013.
300			_aXII, 223 p. 53 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aUndergraduate Texts in Mathematics, _x0172-6056
505	0		_aPreface -- 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. Miscellaneous gems of algebraic combinatorics -- Hints -- References.
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 knowledge to mathematical, engineering, and business models.   The text is primarily intended for use in a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory.  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, and the Sperner property. 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.   Richard Stanley is currently professor of Applied Mathematics at the Massachusetts Institute of Technology. Stanley has received several awards including the George Pólya Prize in applied combinatorics, the Guggenheim Fellowship, and the Leroy P. Steele Prize for mathematical exposition. Also by the author: Combinatorics and Commutative Algebra, Second Edition, © Birkhäuser.
650		0	_aMathematics.
650		0	_aCombinatorics.
650	1	4	_aMathematics.
650	2	4	_aCombinatorics.
650	2	4	_aGraph Theory.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461469971
830		0	_aUndergraduate Texts in Mathematics, _x0172-6056
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-6998-8
912			_aZDB-2-SMA
999			_c95818 _d95818