BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Enumerative Combinatorics, Volume 1

Enumerative Combinatorics, Volume 1

Enumerative Combinatorics, Volume 1
Stock photo: cover may vary

Enumerative Combinatorics, Volume 1 Paperback - 2000

by Richard P. Stanley; Foreword by Gian-Carlo Rota

Add to wish list
  • New
New

Description

Cambridge University Press. New.
Ask the seller a question Add to wish list
NZ$538.72
NZ$8.96 Delivery within USA
Standard delivery: 5 to 8 days
More delivery options
Ships from The Book Forest (California, United States)
The BIBLIO Guarantee

Details

  • Title Enumerative Combinatorics, Volume 1
  • Author Richard P. Stanley; Foreword by Gian-Carlo Rota
  • Binding Paperback
  • Edition New Ed
  • Condition New
  • Pages 340
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press, Cambridge
  • Publication date May 2000
  • Bookseller's Inventory # BAY17-00163
  • ISBN 9780521663519 / 0521663512
  • Weight 1.03 lbs (0.47 kg)
  • Dimensions 9.03 x 6.82 x 1.4 in (22.94 x 17.32 x 3.56 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 96-44267
  • Dewey Decimal Code 511.62
  • Quantity available 1

About The Book Forest California, United States

Biblio member since 2006

The Book Forest has been selling books on the internet since 2004, with a 98% customer approval rating on other internet book selling venues. At The Book Forest we never mislead customers on the condition of a book so that we might make a sale, and we ship all our orders within 24 hours of receiving them. We also have a 100% money back guarantee, and we handle questions and concerns within a few hours of receiving them.

Terms of Sale: The Book Forest offers a 100% money back guarantee on all items. If you are all dissatisfied with the timeliness or condition of your order you can return it for a full refund (we submit refund upon receipt of the book). Partial refunds are also given if the customer so chooses. Please note that standard/media mail takes 4-14 business days, while priority takes 2-4.

Browse books from The Book Forest

Reader reviews for Enumerative Combinatorics, Volume 1

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

This book, the first of a two-volume basic introduction to enumerative combinatorics, concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. Richard Stanley covers those parts of enumerative combinatorics with the greatest applications to other areas of mathematics. The four chapters are devoted to an accessible introduction to enumeration, sieve methods--including the Principle of Inclusion-Exclusion, partially ordered sets, and rational generating functions. A large number of exercises, almost all with solutions, augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

First line

The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set.

Please wait a moment while we load the requested page.

tracking-