Artículos relacionados a Combinatorial Enumeration of Groups, Graphs, and Chemical...

Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds - Tapa blanda

 
9781461291053: Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds

Sinopsis

In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest­ immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera­ tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica­ tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen­ sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest­ immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera­ tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica­ tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen­ sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst.

"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar nuevo

Ver este artículo

EUR 3,42 gastos de envío en Estados Unidos de America

Destinos, gastos y plazos de envío

Otras ediciones populares con el mismo título

9780387964133: Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds

Edición Destacada

ISBN 10:  0387964134 ISBN 13:  9780387964133
Editorial: Springer-Verlag New York Inc., 1987
Tapa dura

Resultados de la búsqueda para Combinatorial Enumeration of Groups, Graphs, and Chemical...

Imagen de archivo

Polya, Georg; Read, R.C.
Publicado por Springer, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Tapa blanda

Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030030297

Contactar al vendedor

Comprar nuevo

EUR 52,25
Convertir moneda
Gastos de envío: EUR 3,42
A Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Polya, Georg
Publicado por Springer 10/2/2011, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Paperback or Softback

Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Paperback or Softback. Condición: New. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds 0.52. Book. Nº de ref. del artículo: BBS-9781461291053

Contactar al vendedor

Comprar nuevo

EUR 56,01
Convertir moneda
Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: 5 disponibles

Añadir al carrito

Imagen de archivo

Georg Polya
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Paperback

Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Paperback. Condición: new. Paperback. In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest- immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera- tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica- tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen- sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods.In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst. In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische AnzahlbestA immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem — the "Hauptsatz" of Section 4 — a theorem which gave a method for solving a general type of enumeraA tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applicaA tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehenA sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an anal Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781461291053

Contactar al vendedor

Comprar nuevo

EUR 62,25
Convertir moneda
Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Georg Polya R. C. Read Dorothee Aeppli
Publicado por Springer, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Tapa blanda

Librería: Books Puddle, New York, NY, Estados Unidos de America

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. pp. 162. Nº de ref. del artículo: 2658567093

Contactar al vendedor

Comprar nuevo

EUR 67,98
Convertir moneda
Gastos de envío: EUR 3,42
A Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen de archivo

Polya, Georg; Read, R.C.
Publicado por Springer, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9781461291053_new

Contactar al vendedor

Comprar nuevo

EUR 59,85
Convertir moneda
Gastos de envío: EUR 13,70
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Georg Polya
Publicado por Springer New York Okt 2011, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Taschenbuch
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the 'Hauptsatz' of Section 4 -- a theorem which gave a method for solving a general type of enumera tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst. 160 pp. Englisch. Nº de ref. del artículo: 9781461291053

Contactar al vendedor

Comprar nuevo

EUR 53,49
Convertir moneda
Gastos de envío: EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Polya Georg Read R. C. Aeppli Dorothee
Publicado por Springer, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Tapa blanda
Impresión bajo demanda

Librería: Majestic Books, Hounslow, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Print on Demand pp. 162 17 Figures, 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 50992746

Contactar al vendedor

Comprar nuevo

EUR 69,41
Convertir moneda
Gastos de envío: EUR 7,43
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen de archivo

Georg Polya
Publicado por Springer-Verlag New York Inc., 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Paperback / softback
Impresión bajo demanda

Librería: THE SAINT BOOKSTORE, Southport, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 267. Nº de ref. del artículo: C9781461291053

Contactar al vendedor

Comprar nuevo

EUR 67,01
Convertir moneda
Gastos de envío: EUR 10,77
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen de archivo

Polya Georg Read R. C.
Publicado por Springer, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Tapa blanda
Impresión bajo demanda

Librería: Biblios, Frankfurt am main, HESSE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. PRINT ON DEMAND pp. 162. Nº de ref. del artículo: 1858567103

Contactar al vendedor

Comprar nuevo

EUR 71,50
Convertir moneda
Gastos de envío: EUR 9,95
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen del vendedor

Georg Polya|R.C. Read
Publicado por Springer New York, 2011
ISBN 10: 1461291054 ISBN 13: 9781461291053
Nuevo Tapa blanda

Librería: moluna, Greven, Alemania

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: 4191645

Contactar al vendedor

Comprar nuevo

EUR 48,37
Convertir moneda
Gastos de envío: EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Existen otras 4 copia(s) de este libro

Ver todos los resultados de su búsqueda