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 ✦
Arithmetical Semigroups Related to Trees and Polyhedra, II — Maps on Surfaces
✍ Scribed by John Knopfmacher; Richard Warlimont
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 242 KB
- Volume
- 235
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
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. A significant aid towards this goal is provided by an extended abstract prime number theorem, based partly on more delicate tools of analysis due to W. K. Hayman [8].
📜 SIMILAR VOLUMES
Arithmetical Semigroups Related to Trees
✍
A. Knopfmacher; J. Knopfmacher
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 152 KB
On traces for functional spaces related
✍
A. Buffa; P. Ciarlet Jr.
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 190 KB
👁 2 views
Adsorption of 1-Butanol and 1-Hexanol Va
✍
Akira Nonaka
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 298 KB