000			02183nam a22003498i 4500
001			CR9780511805967
003			UkCbUP
005			20200124160242.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			101021s1997||||enk o ||1 0|eng|d
020			_a9780511805967 (ebook)
020			_z9780521553094 (hardback)
020			_z9780521663519 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA164.8 _b.S73 1997
082	0	0	_a511/.62 _220
100	1		_aStanley, Richard P., _d1944- _eauthor.
245	1	0	_aEnumerative combinatorics. _nVolume 1 / _cRichard P. Stanley, Foreword by Gian-Carlo Rota.
264		1	_aCambridge : _bCambridge University Press, _c1997.
300			_a1 online resource (xi, 325 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge studies in advanced mathematics ; _v49
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aThis book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.
650		0	_aCombinatorial enumeration problems.
776	0	8	_iPrint version: _z9780521553094
830		0	_aCambridge studies in advanced mathematics ; _v49.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511805967
999			_c518655 _d518653