000			02238cam a2200421 i 4500
001			975372145
003			PTSN
005			20240619150602.0
008			170308s2018 flua b 001 0 eng
010			_a2017011283
019			_a1004763975
020			_a9781498780254 _qhardcover
020			_a1498780253 _qhardcover
035			_a(OCoLC)975372145 _z(OCoLC)1004763975
040			_aDLC _beng _erda _cDLC _dBTCTA _dYDX _dOCLCF _dOCLCO _dYDX
042			_apcc
050	0	0	_aQA164 _b.L64 2018
100	1		_aLoehr, Nicholas A., _eauthor
240	1	0	_aBijective combinatorics
245	1	0	_aCombinatorics / _cNicholas A. Loehr
250			_aSecond edition
264		1	_aBoca Raton, FL : _bCRC Press, Taylor & Francis Group, _c[2018]
300			_axxiv, 618 pages ; _c27 cm
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
490	1		_aDiscrete Mathematics And Its Applications
500			_aPrevious edition: Bijective combinatorics / Nicholas A. Loehr (Boca Raton, FL : Chapman & Hall/CRC, c2011)
504			_aIncludes bibliographical references and index
520			_aBijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, the book presents an introduction to enumerative and algebraic combinatorics emphasizing bijective methods. The text develops mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods to solve enumeration problems. The tools are used to analyze combinatorial structures, words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, and set partitions. -- _cProvided by publisher
650		0	_aCombinatorial analysis
700	1		_aLoehr, Nicholas A. _tBijective combinatorics
830		0	_aDiscrete mathematics and its applications
907			_a.b10567641 _b21-09-23 _c23-02-21
998			_am _b01-01-00 _ca _d- _e- _feng _gflu _h0
999			_c48097 _d48097