Combinatorics / Nicholas A. Loehr.

By:

Loehr, Nicholas A

Contributor(s):

Loehr, Nicholas A

Material type: Text

TextSeries: Discrete mathematics and its applicationsPublication details: Boca Raton : CRC Press, Taylor & Francis Group, 2018.Edition: Second editionDescription: xxiv, 618 pages : illustrations ; 27 cmISBN:

9781498780254

Subject(s):

Combinatorial analysis

DDC classification:

23 311.62 L824C-2

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	Call number	Status	Date due	Barcode
Books	Library and Documentation Division	311.62 L824C-2 (Browse shelf(Opens below))	Available		108226

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.