Combinatorics / Nicholas A. Loehr.

By:

Loehr, Nicholas A [author ]

Contributor(s):

Loehr, Nicholas A. Bijective combinatorics

Material type: Text

text

Media type:

unmediated

Carrier type:

volume

ISBN:

9781498780254
1498780253

Uniform titles:

Bijective combinatorics

Subject(s):

Combinatorial analysis

LOC classification:

QA 43 L64 2018

Summary: Bijective 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. --

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Shelving location	Call number	Copy number	Status	Date due	Barcode
Book	TUP Manila Library	General Circulation Section-GF	QA 43 L64 2018 (Browse shelf(Opens below))	c.1.	Available		P00033103

"A Chapman & Hall book."

Previous edition: Bijective combinatorics / Nicholas A. Loehr (Boca Raton, FL : Chapman & Hall/CRC, c2011).

Includes bibliographical references (pages 595-601) and index.

Bijective 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. --

There are no comments on this title.

to post a comment.