\BOOKMARK [1][-]{section.1}{Introduction and statement of the problem in terms of bipartite perfect matchings}{}% 1
\BOOKMARK [1][-]{section.2}{First moment of the distribution}{}% 2
\BOOKMARK [1][-]{section.3}{Inclusion-exclusion formula for the 0-domino configurations}{}% 3
\BOOKMARK [1][-]{section.4}{2k arrays: specific results}{}% 4
\BOOKMARK [2][-]{subsection.4.1}{The \(k-1\)-domino configurations and the Fibonacci tree}{section.4}% 5
\BOOKMARK [2][-]{subsection.4.2}{Generating functions for the number of \(k-l\)-domino configurations}{section.4}% 6
\BOOKMARK [1][-]{section.5}{Acknowledgments}{}% 7
\BOOKMARK [1][-]{appendix.A}{A selection of Nm,k\(p\) for rectangular two-dimensional arrays}{}% 8