Wintersalen Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    Interviews | October 28, 2014

    Jill Owens: IMG Miriam Toews: The Powells.com Interview



    Some people are compelled by a restlessness from within; others are shaped by the unwieldy forces around them. In Miriam Toews's poignant new novel... Continue »

    spacer

Bijective Combinatorics (Discrete Mathematics and Its Applications)

by

Bijective Combinatorics (Discrete Mathematics and Its Applications) Cover

 

Synopses & Reviews

Book News Annotation:

In a textbook for an advanced undergraduate or beginning graduate course, Loehr (Virginia Polytechnic Institute and State University) presents a general introduction to enumerative combinatorics that emphasizes bijective methods. He explains the mathematical tools of basic counting rules, recursions, inclusion-exclusion, techniques, generating functions, bijective proofs, and linear algebraic methods then demonstrates how to used them to analyze many combinatorial structures. Most of the text requires no more mathematical background than basic logic, set theory, and proof techniques, but some sections assume some exposure to ideas from linear algebra. Annotation ©2011 Book News, Inc., Portland, OR (booknews.com)

Synopsis:

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, Bijective Combinatorics presents a general introduction to enumerative and algebraic combinatorics that emphasizes bijective methods.

The text systematically develops the mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods, needed to solve enumeration problems. These tools are used to analyze many combinatorial structures, including words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, set partitions, Eulerian tours, derangements, posets, tilings, and abaci. The book also delves into algebraic aspects of combinatorics, offering detailed treatments of formal power series, symmetric groups, group actions, symmetric polynomials, determinants, and the combinatorial calculus of tableaux. Each chapter includes summaries and extensive problem sets that review and reinforce the material.

Lucid, engaging, yet fully rigorous, this text describes a host of combinatorial techniques to help solve complicated enumeration problems. It covers the basic principles of enumeration, giving due attention to the role of bijective proofs in enumeration theory.

Product Details

ISBN:
9781439848845
Author:
Loehr, Nicholas A.
Publisher:
CRC Press
Author:
Loehr, Nicholas
Subject:
Operating Systems - General
Publication Date:
20110231
Binding:
HARDCOVER
Language:
English

Related Subjects

Computers and Internet » Operating Systems » General
Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Combinatorics

Bijective Combinatorics (Discrete Mathematics and Its Applications) New Hardcover
0 stars - 0 reviews
$127.25 Backorder
Product details pages CRC Press - English 9781439848845 Reviews:
"Synopsis" by , 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, Bijective Combinatorics presents a general introduction to enumerative and algebraic combinatorics that emphasizes bijective methods.

The text systematically develops the mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods, needed to solve enumeration problems. These tools are used to analyze many combinatorial structures, including words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, set partitions, Eulerian tours, derangements, posets, tilings, and abaci. The book also delves into algebraic aspects of combinatorics, offering detailed treatments of formal power series, symmetric groups, group actions, symmetric polynomials, determinants, and the combinatorial calculus of tableaux. Each chapter includes summaries and extensive problem sets that review and reinforce the material.

Lucid, engaging, yet fully rigorous, this text describes a host of combinatorial techniques to help solve complicated enumeration problems. It covers the basic principles of enumeration, giving due attention to the role of bijective proofs in enumeration theory.

spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.