Have one to sell? Sell yours here
Combinatorial Enumerations of Groups, Graphs, and Chemical Compounds
  
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Combinatorial Enumerations of Groups, Graphs, and Chemical Compounds [Hardcover]

Georg Polya (Author), R.C. Read (Author), Dorothee Aeppli (Translator)
4.0 out of 5 stars  See all reviews (1 customer review)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for Students. Learn more


Product Details

  • Hardcover: 148 pages
  • Publisher: Springer; 1 edition (April 3, 1987)
  • Language: English
  • ISBN-10: 0387964134
  • ISBN-13: 978-0387964133
  • Shipping Weight: 14.4 ounces
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #3,326,142 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and 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

4 of 4 people found the following review helpful:
4.0 out of 5 stars Polya's theorem on enumeration modulo a group, April 22, 2006
This review is from: Combinatorial Enumerations of Groups, Graphs, and Chemical Compounds (Hardcover)
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".
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

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



Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

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 Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

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


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject