Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 115,67
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 158,00
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 411 pages. 9.25x6.50x1.25 inches. In Stock.
Sprache: Englisch
Verlag: Kluwer Academic Publishers, 2000
ISBN 10: 0792355997 ISBN 13: 9780792355991
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Suitable for college teachers, graduate students working in mathematics, especially in combinatorics and graph theory, functional and approximate analysis and algebraic systems, this title provides a unified theory of maps and their enumerations. Series: Mathematics and its Applications. Num Pages: 411 pages, biography. BIC Classification: PBP; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 23. Weight in Grams: 774. . 2000. Hardback. . . . . Books ship from the US and Ireland.
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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].