With emphasis on some natural asymptotic enumeration questions, a study is made of various arithmetical semigroups associated with isomorphism classes of finite graphs, trees and polyhedra. A suitable ``abstract prime number theorem'' is derived, particularly as an aid to solving the counting questi
โฆ LIBER โฆ
Polyhedra related to a lattice
โ Scribed by V. P. Grishuhin
- Publisher
- Springer-Verlag
- Year
- 1981
- Tongue
- English
- Weight
- 957 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Arithmetical Semigroups Related to Trees
โ
A. Knopfmacher; J. Knopfmacher
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 152 KB
Polyhedra related to integer-convex poly
โ
Dennis Michaels; Robert Weismantel
๐
Article
๐
2005
๐
Springer-Verlag
๐
English
โ 226 KB
Regular polyhedra related to projective
โ
Peter McMullen
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 627 KB
A new formula for the volume of lattice
โ
Krzysztof Koลodziejczyk
๐
Article
๐
1996
๐
Springer Vienna
๐
English
โ 327 KB
Voronoi Polyhedra: A Useful Tool to Dete
โ
Prof. Dr. habil. J. Bohm; Prof. Dr. R. B. Heimann; M. Bohm
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 473 KB
Arithmetical Semigroups Related to Trees
โ
John Knopfmacher; Richard Warlimont
๐
Article
๐
2002
๐
John Wiley and Sons
๐
English
โ 242 KB
This paper extends recent investigations by Arnold Knopfmacher and John Knopfmacher [10] of asymptotic enumeration questions concerning finite graphs, trees and polyhedra. The present emphasis is on the counting of non-isomorphic maps of not necessarily connected finite graphs on arbitrary surfaces.