Enumerative Theory Of Maps (Hardcover, 2000 ed.)

Combinatorics as a branch of mathematics studies the arts of counting. Enumeration occupies the foundation of combinatorics with a large range of applications not only in mathematics itself but also in many other disciplines. It is too broad a task to write a book to show the deep development in every corner from this aspect. This monograph is intended to provide a unified theory for those related to the enumeration of maps. For enumerating maps the first thing we have to know is the sym metry of a map. Or in other words, we have to know its automorphism group. In general, this is an interesting, complicated, and difficult problem. In order to do this, the first problem we meet is how to make a map considered without symmetry. Since the beginning of sixties when Tutte found a way of rooting on a map, the problem has been solved. This forms the basis of the enumerative theory of maps. As soon as the problem without considering the symmetry is solved for one kind of map, the general problem with symmetry can always, in principle, be solved from what we have known about the automorphism of a polyhedron, a synonym for a map, which can be determined efficiently according to another monograph of the present author Liu58]."

General

Imprint:	Springer
Country of origin:	Netherlands
Series:	Mathematics and Its Applications, 468
Release date:	2001
First published:	1999
Authors:	Liu Yanpei
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Hardcover
Pages:	411
Edition:	2000 ed.
ISBN-13:	978-0-7923-5599-1
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Topology > General Promotions
LSN:	0-7923-5599-7
Barcode:	9780792355991

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!