000			02296cam a2200337 a 4500
001			16957183
005			20171102184035.0
008			110912s2012 nyua b 001 0 eng
010			_a 2011037989
020			_a9781107602625
040			_aDLC _cDLC _dDLC
042			_apcc
050	0	0	_aQA164.8 _b.S73 2012
082	0	0	_a511.62 _223 _bSTA-E
084			_aMAT008000 _2bisacsh
100	1		_aStanley, Richard P.
245	1	0	_aEnumerative combinatorics, vol I _cRichard P. Stanley.
250			_a2nd ed.
260			_aCambridge : _bCambridge University Press, _c©2012.
300			_axiii, 626 p. : _bill. ; _c24 cm.
490	0		_aCambridge studies in advanced mathematics ; _v49
504			_aIncludes bibliographical references and index.
505	8		_aMachine generated contents note: 1. What is enumerative combinatorics?; 2. Sieve methods; 3. Partially ordered sets; 4. Rational generating functions.
520			_a"Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets"--
650		0	_aCombinatorial enumeration problems.
650		7	_aMATHEMATICS / Discrete Mathematics. _2bisacsh
856	4	2	_3Cover image _uhttp://assets.cambridge.org/97811070/15425/cover/9781107015425.jpg
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c7391 _d7391