Checks for bipartite maps   

> # Check that different programs give the same answers!
{seq(seq(Bng(n,g/2)-bipmapsEdgesGenus(n,g/2),g=0..3),n=1..6)};
 

{0} (4.3.1)
 

> # PLANAR BIPARTITE MAPS (=bicubic up to standard bijections, OEIS A000257)
seq(subs(u=1,z=1,v=1,Bng(i,0)),i=1..10);


 

1, 3, 12, 56, 288, 1584, 9152, 54912, 339456, 2149888 (4.3.2)
 

> #Check: total number of bipartite maps of size n, regardless of genus or other parameters
# we make an exponential generating function
add(bipmapsEdges(n)*t^n/2/n,n=1..7):
series(exp(subs(u=1,v=1,z=1,%)),t=0,8);

# This can be encoded by gluing matchings and we have an explicit formula:
1+add(((2*n)!/2^n/n!)^2/n!/2^n*t^n,n=1..8):
series(%-%%,t=0,7);

 

 

series(`+`(1, `*`(`/`(1, 2), `*`(t)), `*`(`/`(9, 8), `*`(`^`(t, 2))), `*`(`/`(75, 16), `*`(`^`(t, 3))), `*`(`/`(3675, 128), `*`(`^`(t, 4))), `*`(`/`(59535, 256), `*`(`^`(t, 5))), `*`(`/`(2401245, 1024...
series(`+`()+O(`^`(t, 7)),t,7) (4.3.3)