Enumerative Theory Of Maps: 468 (Mathematics and Its Applications, 468) - Image 1

£73.20

Springer Enumerative Theory Of Maps: 468 (Mathematics and Its Applications, 468)

Name: Enumerative Theory Of Maps: 468 (Mathematics and Its Applications, 468)
Brand: Springer
Price: 73.2 GBP
Availability: InStock

Computer Science

About as cheap as it gets. The only time it was cheaper was 2 months ago.

£73 today · all-time low £70 (Apr 2026) · usually £73

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 85 days • 85 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 85 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £70 (39 days, 45.9%)

Price range: £70 - £90

Price levels: 4 different prices over 85 days

Description

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].

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 0792355997
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 31 August 2000
Listed Since: 15 December 2006

Barcode

No barcode data available

Springer Enumerative Theory Of Maps: 468 (Mathematics and Its Applications, 468)

About as cheap as it gets. The only time it was cheaper was 2 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Counting with Symmetric Functions: 43 (Developments in Mathematics, 43)

Combinatorial Foundation of Homology and Homotopy: Applications to Spaces, Diagrams, Transformation Groups, Compactifications, Differential Algebras, ... (Springer Monographs in Mathematics)

Investigations in Algebraic Theory of Combinatorial Objects: 84 (Mathematics and its Applications, 84)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Topological Methods in Group Theory: 243 (Graduate Texts in Mathematics, 243)

Power Algebras over Semirings: With Applications in Mathematics and Computer Science: 488 (Mathematics and Its Applications, 488)

Topics in Computational Algebra

Matroid Theory and its Applications in Electric Network Theory and in Statics: 6 (Algorithms and Combinatorics, 6)

Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An EATCS Series)

Combinatorics and Reasoning: Representing, Justifying and Building Isomorphisms: 47 (Mathematics Education Library)

Automorphisms of Affine Spaces

The Theory of Lattice-Ordered Groups: 307 (Mathematics and Its Applications, 307)

Combinatorial Mathematics

Mathematics of Ramsey Theory: 5 (Algorithms and Combinatorics, 5)

Locally Mixed Symmetric Spaces (Springer Monographs in Mathematics)

An Illustrated Introduction to Topology and Homotopy

Set Theory: Techniques and Applications Curaçao 1995 and Barcelona 1996 Conferences

Combinatorics, Automata and Number Theory: 135 (Encyclopedia of Mathematics and its Applications, Series Number 135)

Mathematical Theory of Optimization: 56 (Nonconvex Optimization and Its Applications, 56)

Theory of Complex Homogeneous Bounded Domains: 569 (Mathematics and Its Applications, 569)

Moduli in Modern Mapping Theory (Springer Monographs in Mathematics)

Cellular Automata: A Parallel Model: 460 (Mathematics and Its Applications, 460)

Cellular Automata: A Parallel Model: 460 (Mathematics and Its Applications, 460)

The q-theory of Finite Semigroups (Springer Monographs in Mathematics)