\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand*\HyPL@Entry[1]{}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction and statement of the problem in terms of bipartite perfect matchings}{1}{section.1}}
\citation{Kast}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A $2\times 3$ game of memory showing a 1-domino configuration.}}{2}{figure.1}}
\newlabel{fig23color}{{1}{2}{A $2\times 3$ game of memory showing a 1-domino configuration}{figure.1}{}}
\newlabel{defN}{{1}{2}{Introduction and statement of the problem in terms of bipartite perfect matchings}{equation.1.1}{}}
\newlabel{kast}{{1}{2}{Introduction and statement of the problem in terms of bipartite perfect matchings}{equation.1.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The graphs $G$, $\mathaccentV {bar}016G$ and $\mathaccentV {bar}016G_B$ for the $2\times 3$ rectangular array.}}{3}{figure.2}}
\newlabel{grid}{{2}{3}{The graphs $G$, $\bar G$ and $\bar G_B$ for the $2\times 3$ rectangular array}{figure.2}{}}
\newlabel{gbarpm}{{1}{3}{Introduction and statement of the problem in terms of bipartite perfect matchings}{equation.1.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The boards for the grid graphs $G$ associated with a $m\times k$ array for $m=1,\ldots  ,10$. Note that $k$ is chosen differently in each case. Upon close inspection, the pattern of repetition becomes obvious.}}{4}{figure.3}}
\newlabel{figboards}{{3}{4}{The boards for the grid graphs $G$ associated with a $m\times k$ array for $m=1,\ldots ,10$. Note that $k$ is chosen differently in each case. Upon close inspection, the pattern of repetition becomes obvious}{figure.3}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}First moment of the distribution}{4}{section.2}}
\newlabel{moment}{{1}{4}{}{theorem.1}{}}
\citation{Hosoya}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces An example of a three-dimensional array with 6 cubes and 28 faces. A game of memory played on this array has $\mathaccentV {bar}016p = 4/5$.}}{5}{figure.4}}
\newlabel{fig3d}{{4}{5}{An example of a three-dimensional array with 6 cubes and 28 faces. A game of memory played on this array has $\bar p = 4/5$}{figure.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Inclusion-exclusion formula for the 0-domino configurations}{5}{section.3}}
\citation{KP}
\citation{JR}
\citation{JR1}
\citation{ML}
\newlabel{zero}{{4}{6}{}{theorem.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}$2\times k$ arrays: specific results}{6}{section.4}}
\newlabel{riordan}{{1}{6}{$2\times k$ arrays: specific results}{equation.4.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The board for the grid graph $G$ associated with a $2\times 10$ array.}}{7}{figure.5}}
\newlabel{fig2k}{{5}{7}{The board for the grid graph $G$ associated with a $2\times 10$ array}{figure.5}{}}
\newlabel{comprook}{{2}{7}{$2\times k$ arrays: specific results}{equation.4.2}{}}
\newlabel{di}{{2}{7}{$2\times k$ arrays: specific results}{equation.4.2}{}}
\citation{JR}
\citation{JR1}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces The board corresponding to the rook polynomial $s_n(x)$. For convenience we have indicated the black cells in outline.}}{8}{figure.6}}
\newlabel{figs}{{6}{8}{The board corresponding to the rook polynomial $s_n(x)$. For convenience we have indicated the black cells in outline}{figure.6}{}}
\newlabel{ndi}{{3}{8}{$2\times k$ arrays: specific results}{equation.4.3}{}}
\newlabel{sxy}{{4}{8}{$2\times k$ arrays: specific results}{equation.4.4}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}The $(k-1)$-domino configurations and the Fibonacci tree}{9}{subsection.4.1}}
\newlabel{kminus1}{{5}{9}{}{theorem.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces The $2\times k$ array is broken into three blocks. The position of the central unbreakable block is parametrized by $m$ while its length is given by $p\geq 3$.}}{9}{figure.7}}
\newlabel{figft}{{7}{9}{The $2\times k$ array is broken into three blocks. The position of the central unbreakable block is parametrized by $m$ while its length is given by $p\geq 3$}{figure.7}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces The bijection between the Fibonacci tree of order $k$ and the $(k-1)$-domino configurations. The configuration at each node represents all cyclic permutations of the blocks which that configuration can be broken into.}}{10}{figure.8}}
\newlabel{figtree}{{8}{10}{The bijection between the Fibonacci tree of order $k$ and the $(k-1)$-domino configurations. The configuration at each node represents all cyclic permutations of the blocks which that configuration can be broken into}{figure.8}{}}
\citation{KS}
\citation{Kahk}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Generating functions for the number of $(k-l)$-domino configurations}{11}{subsection.4.2}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Acknowledgments}{12}{section.5}}
\@writefile{toc}{\contentsline {section}{\numberline {A}A selection of $N_{m,k}(p)$ for rectangular two-dimensional arrays}{12}{appendix.A}}
\newlabel{secapp}{{A}{12}{A selection of $N_{m,k}(p)$ for rectangular two-dimensional arrays}{appendix.A}{}}
\bibcite{Kast}{1}
\bibcite{KP}{2}
\bibcite{JR}{3}
\bibcite{JR1}{4}
\bibcite{ML}{5}
\bibcite{Hosoya}{6}
\bibcite{KS}{7}
\bibcite{Kahk}{8}