JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617

HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 89

New methods of research on Riccati
equations for loopless maps
Liyan Pan, Yanpei Liu
AbstractIn this paper, enumerative equations of rooted loopless maps on the surfaces for given number of root-vertex degree and edges
are provided, including orientable, nonorientable and total of genus all. These differential equations are all Riccati type. No feasible and con-
venient way has been in sight for extracting an explicit solution to solve the functional equations up to now. As to general maps on the surfac-
es, compact expression with the edge number for one vertex map has been obtained by our early document. Based on this, the correspond-
ing calculative functions of rooted loopless maps with two parameters are extracted directly and the number can be derived by simple recur-
sive formulae. Meanwhile, some preceding recursive results are indicated in the appendice.

Index TermsLoopless map; Enumerative equation; Calculative function; Riccati type

1 INTRODUCTION
HE enumeration of planar maps (connected graphs
embedded on the sphere) has received a lot of atten-
tion since the seminal work of Tutte in the 60s[1].
Tuttes recursive method consists in translating the de-
composition of a class of maps (typically obtained by de-
leting an edge) into functional equation satisfied by the
corresponding generating function. The translation usual-
ly requires an additional variable, and the obtained func-
tional equation is solved using so-called quadratic method
[2] or its extensions [3]. The final result is, for many
classes of maps, a strinkingly simple couting formu-
la.Tuttes method has the advantage of being systematic,
but is quite technical in the solving the equation and is
restricted only for some special functional equations.
Later, in the 70s, T.Walsh and A.B.Lehmen deeply re-
searched rooted map on orientable surfaces with any ge-
nus in [4], [5], [6] and obtained the direct enumerative
formula of rooted map with single face. In 80s,
D.M.Jackson derived an explicit enumerative formula of
rooted map with one vertex using the algebraic method
[7]. Afterwards, some scholars such as E.A.Bender[8],
D.Arqus[9] further studied the enumeration of various
kinds of rooted maps on surfaces with given genus. So far,
the research of rooted map on the surfaces has entered
into a new period of development.
A map considered here is a 2-cell embedding for a
graph on the surface. If the surface is the plane, or the
sphere, the map is called a planar map. A rooted map is a
map M such that one edge on the boundary of the outer
face is selected and oriented so that the outer face is on
the right hand side of it when one moves along the boun-
dary with the direction. The selected edge is root-edge; its
tail is root-vertex; the outer face is root-face. The degree of
vertex is the number of edges which are connected to it.A
loop has one vertice as the edge two ends. A map is loop-
less if no loop exists. A map is simple if it has neither loop
nor multiple edges. Other terminology undefined can be
consulted in Liu [10].
A surface S in the Euclidean space
3
R is orientable if a
two-dimensional figure (Fig. 1) cannot be moved around
the surface and back to where it started so that it looks
like its own mirror image (Fig. 2). Otherwise the surface is
non-orientable. An abstract surface (i.e., a two-dimensional
manifold) is orientable if a consistent concept of clockwise
rotation can be defined on the surface in a continuous
manner. That is to say that a loop going around one way
on the surface can never be continuously deformed
(without overlapping it) to a loop going around the oppo-
site way. This turns out to be equivalent to the question of
whether the surface contains no subset that is homeomor-
phic to the Mbius strip. Thus, for surfaces, the Mbius
strip may be considered the source of all non-orientability.
The genus of a connected, orientable surface is an integ-
er representing the maximum number of cuttings along
non-intersecting closed simple curves without rendering
the resultant manifold disconnected. It is equal to the
number of handles on it. Alternatively, it can be defined in
terms of the Euler characteristic _ , via the relation-
ship 2 2g _ = for closed surfaces, where g is the genus.
For surfaces with b boundary components, the equation
reads 2 2g b _ = . For instance, the sphere and a disc
both have genus zero. A torus has genus one, as does the
surface of a coffee mug with a handle. The non-orientable
genus, demigenus, or Euler genus of a connected, non-
orientable closed surface is a positive integer representing
the number of cross-caps attached to a sphere. It also can
be defined for a closed surface in terms of the Euler cha-
racteristic _ , via the relationship 2 k _ = , where k is the
non-orientable genus. As an example, a projective plane
has non-orientable genus one. A Klein bottle has non-
orientable genus two.

- LY.P. is PhD with the Department of Mathematics, Science Institute of
Beijing Jiaotong University, Beijing, China, 100044.
- YP.L. is Professor with the Department of Mathematics, Science Institute
of Beijing Jiaotong University, Beijing, China, 100044.


T
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 90


Fig.1. A torus is an orientable surface

Fig. 2.The Mbius strip is a non-orientable surface

Loopless maps have been discussed by some authors
Liu, Y.P. [11, 12], Wormald, N.C. [13].In Li.Z.X [14], the
number of loopless rooted maps on the projective plane
with the size 1 n > is found as the sum of three terms. In
paper [15], Liu discussed general rooted maps on the sur-
faces and achieved three calculative functions for given
edge number, including orientable, nonorientable and
total surfaces. All these functions are all Riccati type.
2 LOOPLESS MAPS ON THE SURFACES
2.1 Orientable equations
Let R to be set of all loopless rooted maps on surfaces
(including orientable and nonorientable) andS , its subset
of all those on orientable surfaces.
First, observeS . Three classes ofS are considered as

0 1 2
= + + S S S S (1)
Where { }
0
= v S , vis the vertex map,
1
S is with the root-
edge a cut-edge and
2
S , of all others.
The enufunction f
S
of S (or f
R
of R ) is considered as a
function of two variables x and y whose powers stand for,
respectively, the valency of root-vertex mand the size n .
Lemma 1. For the part of
0
S in ( ) , f x y
S
, we have
0
1 f = (2)
Where ( )
0
0
, f f x y =
S
.
Proof. Because of no edge in v , the powers of x and
y in
0
f are both zero, and hence the lemma follows.
In order to determine the contributions of
1
S and
2
S to f
S
, the suitable decompositions of them should be
exacted.
Lemma 2. For
1
S , we have

1
= S S S , (3)
Where
{ }
1 1
M a M = e S S , ( )
r
a K M = .
Proof. Because of a as a cut-edge and the heredity of no
loop, the lemma is found.
On the basis of (2), by noticing that for any
1
M eS , one
of the two submaps in M a has its root-vertex valency 1
less than that of M and the other the vanlency without
limitation, we have
1
f xyfh =
S
(4)
where ( )
0
1
, f f x y =
S
, ( ) , f f x y =
S
, ( )
1
1,
x
h f f y
=
= =
S
S
.
Lemma 3. For
2
S , we have

2
= S S v, (5)
where
{ }
2
M a M = e S S , ( )
r
a K M = .
Proof. In virtue of the heredity of no loop,
2
= S S v.
Conversely, for any M e v S , because no loop exists
and M = v, M has at least 1 nonrooted vertex. By the
connectedness of M , an edge which is not a cut-edge
'
a is
permitted for adding on M to obtain
' '
2
M M a = + eS .
Since
' '
2
M M a = eS , we have
2
_ v S S .
On the basis of this lemma, a mappingt :
2
v S S can
be constructed such that for any ( ) , M = e X J v S ,
( ) ( ) ( ) { }
1 2
i
M A i n M m M t = s s (6)
With
( )
,
i
i i r i
A M r K = + = + X J ,
1 i
i i
r x

= J , where is
a cyclic sequence of ( ) ( ) 2n M m M angles not incident to
the root-vertex on M .Because of all
i
A orientable, loopless
and
i i
A r M = , we have
2 i
A eS .
Lemma 4. The contribution of
2
S to f
S
is

2
2
f f
f xy y x
y x
| | c c
=
|
c c
\ .
(7)
Where ( )
2
2
, f f x y =
S
and ( ) , f f x y =
S
.
Proof. From (7.4.6), t provides a partition of
2
S ,
( ) ( ) ( )
( ) ( )
2
2
m M n M
M
f xy n M m M x y
e
| |
=
|
\ .

v S

By employing Theorem 1.3.5 in Liu [4], we have
( )
( ) ( ) m M n M
M
f
n M x y y
y
e
c
=
c

v S
,
( )
( ) ( ) m M n M
M
f
m M x y x
x
e
c
=
c

v S
.
Theorem 1. The equation about function f as
0, 0
(2 ) 1 (1 )
(0,0) 1
x y
f f
xy y x xyh f
y x
f f
= =
c c
= +

c c

= =

S
S S
(8)
Where
1 x
h f
=
=
S S
is well defined in the ring ; , x y L {R } .
Further, the solution is ( , ) f f x y =
s
.
Proof. The second conclusion is derived from (1) in com-
panion with (2), (4), and (7).Then, to prove the first con-
clusion. Let
0
( , )
n
n
n
f x y S y
>
=

, where
n
S is a th n poly-
nomial of x . From (8), we get
1
2 1
1
0
0
0
0
( 1 ) 2( 1)
1, (0) 1, 0
n
n
n l n
l
x
dS
S x S N n l n xS x
dx
dS
S N
dx

=
=

= +

= = =

S
S
(9)
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 91

Where
1
( )
x
N n S
=
=
s
, 0 n > (10)
From the well defines the recursion, the first conclusion is
naturally deduced.
Now, let us discuss R .Similarly toS , R is divided
into three parts as
0 1 2
= + + R R R R (11)
Where
0
R consists of only v,
1
R and
2
R are, respectively,
of maps with the root-edge being and not being a cut-
edge. Similarly to (2) and (4), for
0
R ,
0
1 = g (12)
Where
0
0
( , ) f x y =
R
g .For
1
R ,
1
xy t = g g (13)
Where
1
1
( , ) f x y =
R
g , ( , ) f x y =
R
g and
1
( ) 1,
x
y t f
=
= =
R
g .
Further, for any ( ) , M = e X J R v, there is a map-
ping :
2
R R v such that there is a cyclic sequence of
2 ( ) ( ) n M m M angles not incident to the root-vertex in
M .In fact,
2
2
( )
M
M
e
=

R
R
v
(14)
Based on (14),
2
2 2 ) xy y x
y x
c c
=
c c

g g
g (15)
where ( , ) f x y =
R
g .
2.2 Total equations
Theorem 2. The equation about function f as
0, 0
2 (2 ) 1 (1 )
(0,0) 1
x y
xy y x xyh
y x
f f
= =
c c
= +

c c

= =

g g
g
R
R R
(16)
is well defined in the ring ; , x y L {R } . Further, its solution
is ( , ) f x y = g
R
.
Proof. The last conclusion (16) is from (11) in companion
with (12), (13) and (15).
Let
0
( , )
n
n
n
f x y R y
>
=

where
n
R is an th n polynomial
of x , then (16) leads to the recursion as
1
2 1
1
0
0
0
0
( 1 ) 4( 1) 2
1, (0) 1, 0
n
n
n l R n
l
R
x
dR
R x R N n l n xR x
dx
dR
R N
dx

=
=

= +

= = =

(17)
Where
1
( )
n
x
N n R
=
=
R
, 1 n > , (18)
is the number of all loopless maps with size n on surfaces
(orientable and nonorientable).It is easy to check the well
definedness of the recursion.
2.3 Nonorientable equations
Let N be the set of all rooted nonorientable loopless-
maps. Two classes
1
N and
2
N are partitioned into.
1
{ , M M M a = e N N is orientable}
2
{ , M M M a = e N N is nonorientable}
Here ( )
r
a e M = is the root-edge of M as usual.
Further, for any ( ) , M = e N X J v , there is a map-
pingo :
1
N N v such that there is a cyclic sequence
of 2 ( ) ( ) n M m M angles not incident to the root-vertex in
M .In fact,
1
1
( )
M a
M o
e
=

N
N (19)
Therefore,
1
2 )
f f
xy y x
y x
c c
=
c c
p (20)
Where ( , ) f x y = p
N
.For
2
N , it can be divided into fol-
lowing two subsets:
2 2
{ ,
I
M M a = e N N is a cut-edge }
2 2
{ ,
II
M M a = e N N is not a cut-edge }
For any
2
( ) ,
I
M = eN X J , a is a cut-edge, so
2
I
= + S S N N N +N N
Let (1, ) f y = h
N N
, (1, ) f y =
S S
h .Based on above,
2
I
xy xy xy =
S
p ph h + ph g +
N N
(21)
The investigation about
2
II
N is similar to
2
R .There is a
cyclic sequence of 4 ( ) 2 ( ) n M m M angles not incident to
the root-vertex in M . Hence

2
2 )
II
xy y x
y x
c c
=
c c
4
p p
p (22)
Theorem 3. The equation about function f as
0, 0
2 ) (1 )
2 )
(0, 0) 1
x y
xy y x xy xy
y x
f f
xy y x xyf
y x
f f
= =
c c
=

c c
c c

c c

= =

S
p p
h h p
h
4

N
N
N N
(23)
is well defined in the ring ; , x y L {R } . Further, its solution
is ( , ) f f x y = = p
N
.
Proof.
1 2 2
I II
= + + p p p p , (23) is from (20),(21)and(22)
For orientable case,
0
( , )
n
n
n
f x y S y
>
=

where
n
S is
an th n polynomial of x , and
1
( )
n
x
S s n
=
= ;
For nonorientable case,
0
( , )
n
n
n
f x y T y
>
=

where
n
T is
an th n polynomial of x , and
1
( )
n
x
T t n
=
= , then (24) leads
to the recursion as
1
1
1 1
0 0
1
1
1
0 0
[4( 1) 2 ) [ ( ) ( )]
[2( 1) ] ( 1 )
n
n
n
n n l
n l
n
n
p
n
n p
dT
T x n T x x t l s l T
dx
dS
x n S x x S t n p
dx

> =

> =
= + +
+ +



In order to validate the correctness of the results, we
design one iterated programming using Matlab language
which calculates the coefficient by setting two parameters
(edge number and root-vertex degree) in advance.
3 APPENDICES
Table 1 indicates the number of orientable loopless
maps on the surfaces with root-vertex degree ( ) m M and
the edge number ( ) n M . Table 2 and Table 3 show non-
orientable case and total case respectively
4 CONCLUSION
This paper investigate rooted loolpess maps on the
surfaces (orientable, nonorientable, and total) without
restriction of genus.Based on the discussion about general
rooted maps, the corresponding enumerative functions of
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 92

TABLE1
ON TOTAL SURFACES WITHIN 10 EDGES


TABLE2
ON ORIENTABLE SURFACES WITHIN 10 EDGES


TABLE3
ON NONORIENTABLE SURFACES WITHIN 10 EDGES

rooted loopless maps are extracted and the number can
be derived by simple recursive formulae.These differen-
tial equations are all Riccati type and the consequences
have much simpler form than known result. The applica-
tions of this method can be indicated in enumerating sev-
eral other kinds of rooted maps on the surfaces such as
simple rooted maps.
ACKNOWLEDGMENT
The authors would like to thank the referees for their
useful comments and suggestions. This work was sup-
ported by National Natural Science Foundation of
China under Grant 60373030 and 10871021.
REFERENCES
[1] W.T.Tutte, A census of planar maps,Canada J.Math., Vol.15,
pp:249 271,1963
[2] I.P.Goulden and D.M.Jackson, Combinatorial Enumeration,
John Wiley, New York, 1983.
[3] M.Bousquet-Mlou and A.Jehanne,Polynomial equations with
one catalytic variable, algebraic series and map enumera-
tion,J.Combin.Theory Ser.B,Vol.96(5), pp:623-672,2006
[4] T.Walsh and A.B.Lehman, Counting rooted maps by genus I,
J.Combin.Theory. B,Vol.13, pp:192-218,1972
[5] T.Walsh and A.B.Lehman, Counting rooted maps by genus II,
J.Combin.Theory. B, Vol.13, pp: 122-141, 1972
[6] T.Walsh and A.B.Lehman, Counting rooted maps by genus
III, J.Combin.Theory. B, Vol.18, pp: 222-259, 1975
[7] D.M.Jackson,The genus series for maps,J. of Pure and applied
Algebra,Vol.105,pp:293-297,1995
[8] E.A.Bender and N.C.Wormald, The number of loopless planar
maps, Discret Math.,Vol.54, pp:235-237,1985
[9] D.Arqus and A.Giorgetti,Counting rooted maps on a sur-
face,Theoretical Computer Science,Vol.234,pp:255-272,2000
[10] Yanpei Liu,Enumerative Theory of Maps Dor-
drecht,Boston,London:Kluwer,1999
[11] Yanpei Liu, Enumerating rooted loopless planar maps, Comb.
Optim.CORR 83- 4, Uni. Waterloo, 1983; Also in Acta Math.
Appl. Sinica, Eng. Series 2, pp:14-26, 1985
[12] Yanpei Liu,Counting rooted planar maps, Comb.Optim.
CORR83 26, Uni. Waterloo, 1983; Also in J. Math. Res. Expos, 4:3,
pp:37-46,1984
[13] N.C.Wormald,The asymptotic number of nonsingular and
nonseparable maps on the projec-tive plane, Fourteenth Austra-
lasian Conference on Combinatorial Mathemat-ics and Compu-
ting,Dunedin,1986.Also in Ars Combin., Vol.23 , pp:133-137,1987
[14] Zhaoxiang Li and Yanpei Liu, Enumeration of loopless maps
on the projective plane, J. Appl. Math.&Computing,Vol.10,
pp:145-155,2002
[15] Yanpei Liu, A census of general rooted maps, Journal of Xi-
nyang Normal University (Natural Science Edi-
tion),Vol.17(4),pp:373-380,2004
[16] Liyan Pan and Yanpei Liu,On the functional equations in recti-
linear embedding,Communication in information science and
management engineering,Vol.5,pp:44-51,2011
[17] Liyan Pan and Yanpei Liu,Counting two types of quadrangu-
lations, IEEE International Conference on Consumer Elec-
trics,Communications and Networks(CECNET), pp:3998-
4001,April 16-18,2011
[18] Liyan Pan and Yanpei Liu,Counting rooted near quadrangula-
tions on the sphere,IEEE International Conference on Communi-
cation Software and Networks(ICCSN),pp:526-530,May27-29,2011


liyan Pan has obtained her Bachelor of Science in Information and
Scince in 2005 and received her Master of Science in Mathematics
in 2007 from Department of Mathematics, Science Institute of Beijing
Jiaotong University, Beijing, China. At present, she is a Ph.D. scholar
of Operational Research.Her research area of interests include
Combinatorics, topological surface map enumeration and Software
development for solving high dimensional equations.


Yanpei Liu is a Professor in the Department of Mathematics,
Science Institute of Beijing Jiaotong University, Beijing, China.
He is currently doing research on computional mathematics, Algebra
topology, rectilinear embeddings and network transport planning.