Asymptotic enumeration of reversible maps regardless of genus
نویسندگان
چکیده
منابع مشابه
Asymptotic Enumeration of Reversible Maps Regardless of Genus∗
We derive asymptotic expansions for the numbers U(n) of isomorphism classes of sensed maps on orientable surfaces with given number of edges n, where we do not specify the genus and for the numbers A(n) of reflexible maps with n edges. As expected the ratio A(n)/U(n) → 0 for n → ∞. This shows that almost all maps are chiral. Moreover, we show logA(n) ∼ 12 logU(n) ∼ (n/2) log n. Due to a corresp...
متن کاملEnumeration of maps regardless of genus: Geometric approach
We use the conceptual idea of “maps on orbifolds” and the theory of the nonEuclidian crystallographic groups (NEC groups) to enumerate rooted and unrooted maps (both sensed and unsensed) on surfaces regardless of genus. As a consequence we deduce a formula for the number of chiral pairs of maps. The enumeration principle used in this paper is due to A. D. Mednykh (2006), it counts the number of...
متن کاملAsymptotic Enumeration of Labelled Graphs by Genus
We obtain asymptotic formulas for the number of rooted 2-connected and 3connected surface maps on an orientable surface of genus g with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled k-connected graphs of orientable g...
متن کاملEnumeration of unrooted maps with given genus
Let Ng(f) denote the number of rooted maps of genus g having f edges. Exact formula for Ng(f) is known for g = 0 (Tutte 1963), g = 1 (Arques 1987), g = 2, 3 (Bender and Canfield 1991). In the present paper we derive an enumeration formula for the number Θγ(e) of unrooted maps on an orientable surface Sγ of given genus γ and given number of edges e. It has a form of a linear combination ∑ i,j ci...
متن کاملAsymptotic enumeration and limit laws for graphs of fixed genus
It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface Sg of genus g grows asymptotically like cnγn! where c > 0, and γ ≈ 27.23 is the exponential growth rate of planar graphs. This generalizes the result for the planar case g = 0, obtained by Giménez and Noy. An analogous result for non-orientable surfaces is obtained. In addition, it is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2011
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.145.42c