𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration on Nonseparable Planar Maps

✍ Scribed by Junliang Cai; Yanpei Liu


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
206 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


This paper provides some functional equations satisfied by the generating functions for nonseparable rooted planar maps with the valency of root-vertex, the number of edges and the valency of root-faces of the maps as three parameters. But the solutions of these equations can only be obtained indirectly by considering some relations between nonseparable and general rooted planar maps. One of them is an answer to the open problem 6.1 in Liu (1983, Comb. Optim. CORR83-26, University of Waterloo).


πŸ“œ SIMILAR VOLUMES


Exact Enumeration of 1342-Avoiding Permu
✍ MiklΓ³s BΓ³na πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 318 KB

Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function H(x) of all 1342-avoiding permutations of length n as well as an exact formula for their number S n (1342). While achieving this, we bijectively prove that the number of ind

Regular Maps on Surfaces with Large Plan
✍ Roman Nedela; Martin Ε koviera πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 324 KB

A map is a cell decomposition of a closed surface; it is regular if its automorphism group acts transitively on the flags, mutually incident vertex-edge-face triples. The main purpose of this paper is to establish, by elementary methods, the following result: for each positive integer w and for each

Enumeration of 2 -connected Loopless 4 -
✍ Han Ren; Yanpei Liu; Zhaoxiang Li πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 195 KB

In this paper rooted (near-) 4-regular maps on the plane are counted with respect to the root-valency, the number of edges, the number of inner faces, the number of non-root vertex loops, the number of non-root vertex blocks, and the number of multi-edges. As special cases, formulae of several types