In How Many Ways Can n (Straight) Men and n (Straight) Women Get Married,
if Each Person Has Exactly k Spouses
By Shalosh B. EKHAD and Doron ZEILBERGER
.pdf
.ps
.tex
Exclusively published in the
Personal Journal of Shalosh B. Ekhad and Doron Zeilberger
First Written: Dec. 29, 2006.
This version: Jan. 11, 2007.
What's so nice about this work is that ONE program does both
the symbolcrunching and the numbercrunching. Of course, to
do serious numbercrunching, you might have to go to C, after
doing codegeneration in Maple, but we can still
go pretty far just with Maple.
Important: This article is accompanied by Maple
packages
Sample Output for Bipartite
The input
yields the output.
Sample Output for LatinRectangles

To find the first 20 terms of the
enumerating sequence for 1 by n Latin Rectangles,
divided by n!,
The input
yields the
output.

To find the first 20 terms of the
enumerating sequence for 2 by n Latin Rectangles,
divided by n!,
The input
yields the output.

To find the first 20 terms of the
enumerating sequence for 3 by n Latin Rectangles,
divided by n!,
The input
yields the output.

To find the first 9 terms of the
enumerating sequence for 4 by n Latin Rectangles,
divided by n!,
The input
yields the output.
Personal Journal of Shalosh B. Ekhad and Doron Zeilberger
Doron Zeilberger's Home Page