\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]{}
\citation{dickson1954history}
\citation{sellers2002domino}
\citation{OEIS}
\citation{katz2009tiling}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
\citation{OEIS}
\citation{riordan1965basic}
\citation{dujella1999bijective}
\citation{stanica2000generating}
\citation{mansour2004formula}
\citation{zhang2017Fibonacci}
\@writefile{toc}{\contentsline {section}{\numberline {2}Closed form for $\EuScript  {W}_{k;(0,1;p,q)}(x)$}{4}{section.2}}
\newlabel{FibonacciMinimalBoard}{{3}{4}{}{theorem.3}{}}
\newlabel{lem:wnpq}{{6}{4}{}{theorem.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Nine $F_{2\times 3; (p,q)}$ boards.}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {$M_{2\times (1,1,1); (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {$M_{2\times (1,2); (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(c)}{\ignorespaces {$M_{2\times (2,1); (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(d)}{\ignorespaces {$M_{2\times (1,2); (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(e)}{\ignorespaces {$M_{2\times (2,1); (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(f)}{\ignorespaces {$M_{2\times (1,2); (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(g)}{\ignorespaces {$S_{1,2\times 3; (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(h)}{\ignorespaces {$S_{1,2\times 3; (p,q)}$}}}{5}{figure.1}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(i)}{\ignorespaces {$M_{2\times (2,1); (p,q)}$}}}{5}{figure.1}}
\newlabel{9boards}{{1}{5}{Nine $F_{2\times 3; (p,q)}$ boards}{figure.1}{}}
\newlabel{rem:uniquelyDivide}{{7}{5}{}{theorem.7}{}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces $m_{4\times n; (2,-1)}$ for $1\leq n \leq 7$.}}{6}{table.1}}
\newlabel{tab:m{4timesn}}{{1}{6}{$m_{4\times n; (2,-1)}$ for $1\leq n \leq 7$}{table.1}{}}
\newlabel{lem:Wnpq}{{9}{6}{}{theorem.9}{}}
\newlabel{ex:W4}{{10}{7}{}{theorem.10}{}}
\newlabel{lem:ek01pq}{{11}{7}{}{theorem.11}{}}
\newlabel{ex:e4}{{12}{8}{}{theorem.12}{}}
\newlabel{lem:matrixCH03}{{13}{8}{}{theorem.13}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Two different boards.}}{9}{figure.2}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {$M_{4\times 5; (p,q)}$, also $S_{1,4\times 5; (p,q)}$}}}{9}{figure.2}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {$M_{4\times (3,2); (p,q)}$}}}{9}{figure.2}}
\newlabel{examples}{{2}{9}{Two different boards}{figure.2}{}}
\newlabel{lem:mpq}{{16}{9}{}{theorem.16}{}}
\newlabel{lem:spq}{{17}{10}{}{theorem.17}{}}
\newlabel{lem:BACpq}{{19}{10}{}{theorem.19}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces How to transform $S_{1,4\times 5; (p,q)}$ to $S_{2,4\times 6; (p,q)}$.}}{11}{figure.3}}
\newlabel{transform01pq}{{3}{11}{How to transform $S_{1,4\times 5; (p,q)}$ to $S_{2,4\times 6; (p,q)}$}{figure.3}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces $s_{j,4\times n;(2,-1)}$, $j=1,2,3$, for $2\leq n \leq 7$.}}{12}{table.2}}
\newlabel{tab:sj4n}{{2}{12}{$s_{j,4\times n;(2,-1)}$, $j=1,2,3$, for $2\leq n \leq 7$}{table.2}{}}
\newlabel{thm:main}{{21}{12}{}{theorem.21}{}}
\newlabel{cor:Ak(x)}{{23}{13}{}{theorem.23}{}}
\bibcite{dickson1954history}{1}
\bibcite{dujella1999bijective}{2}
\bibcite{katz2009tiling}{3}
\bibcite{mansour2004formula}{4}
\bibcite{riordan1965basic}{5}
\newlabel{cor:Dkpq}{{25}{14}{}{theorem.25}{}}
\newlabel{rem:secondAk(x)}{{26}{14}{}{theorem.26}{}}
\bibcite{sellers2002domino}{6}
\bibcite{OEIS}{7}
\bibcite{stanica2000generating}{8}
\bibcite{zhang2017Fibonacci}{9}