Liu yanpei (129 risultati)

Hardcover. Octavo, 398 pages. In Very Good minus condition. Yellow spine with brown text. Boards have rubbing to corners and light sunning to spine. Textblock clean. NOTE: Shelved in Netdesk Column R (ND-R). 1377334. FP New Rockville Stock.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New. In English.

Condizione: 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. . . . .…

Condizione: New.

Condizione: New. pp. 416.

Condizione: New. pp. 428.

Taschenbuch. Condizione: 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].…

Buch. Condizione: 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].…

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embeddability, problems concerning graphic and cographic matroids and the knot problem from topology to combinatorics are discussed. Rectilinear embeddability, and the net-embeddability of a graph, which appears from the VSLI circuit design and has been much improved by the author recently, is also illustrated. Furthermore, some optimization problems related to planar and rectilinear embeddings of graphs, including those of finding the shortest convex embedding with a boundary condition and the shortest triangulation for given points on the plane, the bend and the area minimizations of rectilinear embeddings, and several kinds of graph decompositions are specially described for conditions efficiently solvable. At the end of each chapter, the Notes Section sets out the progress of related problems, the background in theory and practice, and some historical remarks. Some open problems with suggestions for their solutions are mentioned for further research.…

Condizione: New. pp. 420.

Condizione: New. pp. 428.

Taschenbuch. Condizione: Neu. Enumerative Theory Of Maps | Liu Yanpei | Taschenbuch | xi | Englisch | 2013 | Springer | EAN 9789401058834 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Brand New. 420 pages. 9.25x6.10x0.94 inches. In Stock.

Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: New.

Hardcover. Condizione: Brand New. 411 pages. 9.25x6.50x1.25 inches. In Stock.

Condizione: 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.…

Condizione: New.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Gebunden. Condizione: New. This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embedda.