See buying choices for this item to see if it's one of the millions that are eligible for Amazon Prime.

Have one to sell? Sell yours here
 
   
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
  
I own the rights to this title and would like to make it available again through Amazon.
Tell the Publisher!
I’d like to read this book on Kindle

Don’t have a Kindle? Get yours here.
 
  

Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Hardcover)

by George Polya (Author), R. C. Read (Author)
4.0 out of 5 stars See all reviews (1 customer review)

Available from these sellers.


2 used from $209.77

Product Details
Citations (learn more)
15 books cite this book:
See all 15 books citing this book

Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
Check the boxes next to the tags you consider relevant or enter your own tags in the field below.
(1)
(1)
(1)

Your tags: Add your first tag
 
See most popular tags
Help others find this product — tag it for Amazon search
No one has tagged this product for Amazon search yet. Why not be the first to suggest a search for which it should appear?

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more
 

Customer Reviews

1 Review
5 star:    (0)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

 
3 of 3 people found the following review helpful:
4.0 out of 5 stars Polya's theorem on enumeration modulo a group, April 22, 2006
This is a translation of the 1937 paper by Polya where he showed his theorem on enumeration modulo a group. This is his prototypical example: one colours the vertices of an octahedron (say, three red, two blue, one yellow); in how many ways can this be done, taking into account rotational equivalence? All problems of this type are solved in a single sweep. All we need to know about the group is read off the cycle decomposition of the elements and easily encoded in a single polynomial expression, the "cycle index". The generating function that solves the general problem is then obtained by simply substituting the generating function for the stuff that is to be assigned (i.e. the colours) into this cycle index expression. With this powerful theorem Polya attacks enumeration problems for graphs and trees, which, he eagerly points out, "presents a continuation of work done by Cayley" (first sentence of the paper). As Cayley knew, one gets for free some very picturesque applications in terms of chemical compounds---the order of a vertex in a graph corresponds to the valency of an atom in a molecule. Accordingly, we can now enumerate "structurally isomeric alcohols C_nH_(2n+1)OH" and the like. The book also contains a forty-page supplement by Read on "The legacy of Polya's paper".
Comment Comment | Permalink | Was this review helpful to you?


Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews


Customer Discussions

 Beta (What's this?)
New! See all customer communities, and bookmark your communities to keep track of them.
This product's forum (0 discussions)
  Discussion Replies Latest Post
  No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
  [Cancel]


Active discussions in related forums
   

Product Information from the Amapedia Community

Beta (What's this?)

Look for Similar Items by Category

Don't Slip and Slide

HeatTrak Heated Walkway

Keep your walkways safe and clear of snow and ice using the HeatTrak heated walkway.

›Shop all HeatTrak heated walkways

  

Big Savings in Books

Bargain Books
Find great titles at fantastic prices in our Bargain Books Store.
 

Buy Three Books, Get a Fourth Free

4-for-3 Books
Order any four eligible books under $10 and get the lowest-price book free in our 4-for-3 Books Store. See more details.
  

Best Books

Best of the Month
See our editors' picks and more of the best new books on our Best of the Month page.
  

 

Feedback

If you need help or have a question for Customer Service, contact us.
 Would you like to update product info or give feedback on images?
Is there any other feedback you would like to provide? Click here

Your comments can help make our site better for everyone.



Where's My Stuff?

Shipping & Returns

Need Help?

Your Recent History

  (What's this?)
You have no recently viewed items or searches.

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.

amazon.com Amazon.com Home  |   Directory of All Stores
International Sites:  Canada  |  United Kingdom  |  Germany  |  Japan  |  France  |  China
Business Programs: Sell on Amazon  |  Build an eCommerce Site  |  Advertise With Us  |  Developer Services  |  Self-Publish with Us
Help  |  View Cart  |  Your Account  |  1-Click Settings
Investor Relations  |  Press Releases  |  Careers at Amazon  |  Join Associates  |  Join Advantage
Conditions of Use | Privacy Notice © 1996-2009, Amazon.com, Inc. or its affiliates