Bijective Combinatorics
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Bijective Combinatorics: (Discrete Mathematics and Its Applications)
Bijective Combinatorics: (Discrete Mathematics and Its Applications)

Bijective Combinatorics: (Discrete Mathematics and Its Applications)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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

Table of Contents:
Introduction. Basic Counting. Combinatorial Identities and Recursions. Counting Problems in Graph Theory. Inclusion-Exclusion and Related Techniques. Ranking and Unranking. Counting Weighted Objects. Formal Power Series. The Combinatorics of Formal Power Series. Permutations and Group Actions. Tableaux and Symmetric Polynomials. Abaci and Antisymmetric Polynomials. Additional Topics. Answers and Hints to Selected Exercises. Bibliography. Index.

About the Author :
Nicholas A. Loehr teaches in the Department of Mathematics at Virginia Tech. His research interests include enumerative and algebraic combinatorics; symmetric and quasisymmetric functions; integer partitions, lattice paths, parking functions, and tableaux; bijective methods; and algorithm analysis.

Review :
This textbook, aimed at beginning graduate students, is the first to survey the subject emphasizing the role of bijections. ... The final chapter contains a potpourri of delightful results ... The exposition is careful and deliberate, and leaves no stone unturned ... a welcome addition to the literature and a very nice book. -David Callan, Mathematical Reviews, 2012d A rule I have found to be true is that any book claiming to be suitable for beginners and yet leading to the frontiers of unsolved research problems does neither well. This book is the exception to that rule. ... I found this book engaging. The proofs are very clear, and in many cases several proofs are offered. ... This book could serve several purposes. By focusing on the first half of the book, it could be an excellent choice for a first course in combinatorics for senior undergraduates. By selecting topics and/or moving quickly, it could work well for a more mature audience. ... it also makes a great reference for people who use combinatorics but are not specialists. ... This is a very nice book that deserves serious consideration. -Peter Rabinovitch, MAA Reviews, September 2011 This book is a comprehensive treatment of the combinatorics of counting ... The book would be suitable for advanced undergraduates or as a graduate text. It would also be a good book for a computer scientist who wants to learn about enumeration. The book begins with an enchanting introductory chapter. It details a series of interesting motivational problems ... The book is clearly written and packed with examples and problems (it provides answers and hints to selected problems at the end). The organization is superior, with helpful tables of notation and definitions at the end of each chapter, along with a point-by-point summary of the chief topics. ... the book is an excellent one, and is a comprehensive and welcome addition to the area. -Angele M. Hamel, Computing Reviews, August 2011


Best Sellers


Product Details
  • ISBN-13: 9781439848869
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: Chapman & Hall/CRC
  • Language: English
  • No of Pages: 612
  • ISBN-10: 1439848866
  • Publisher Date: 10 Feb 2011
  • Binding: Digital (delivered electronically)
  • No of Pages: 612
  • Series Title: Discrete Mathematics and Its Applications


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Bijective Combinatorics: (Discrete Mathematics and Its Applications)
Taylor & Francis Ltd -
Bijective Combinatorics: (Discrete Mathematics and Its Applications)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Bijective Combinatorics: (Discrete Mathematics and Its Applications)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!