\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{B}
\citation{G}
\citation{BPS}
\citation{BQ}
\citation{ML}
\citation{S}
\citation{KS}
\citation{KS}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
\citation{S}
\citation{KS}
\citation{BQ}
\@writefile{toc}{\contentsline {section}{\numberline {2}Some combinatorial identities}{2}{section.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A $(2\times n)$-board and a pruned $(2\times n)$-board.}}{2}{figure.1}}
\newlabel{pruned}{{1}{2}{A $(2\times n)$-board and a pruned $(2\times n)$-board}{figure.1}{}}
\newlabel{eql}{{1}{3}{Some combinatorial identities}{equation.2.1}{}}
\newlabel{theorem}{{1}{3}{}{theorem.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The endings for obtaining a recurrence relation for $l_{n}^{a,b}$.}}{3}{figure.2}}
\newlabel{rec}{{2}{3}{The endings for obtaining a recurrence relation for $l_{n}^{a,b}$}{figure.2}{}}
\newlabel{idn1}{{2}{4}{}{theorem.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces To prove Identity\nobreakspace  {}\ref  {idn1}, condition on the location of the last domino.}}{4}{figure.3}}
\newlabel{id1}{{3}{4}{To prove Identity~\ref {idn1}, condition on the location of the last domino}{figure.3}{}}
\newlabel{idn2}{{3}{5}{}{theorem.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces To prove Identity\nobreakspace  {}\ref  {idn2}, condition on the location of the last square.}}{5}{figure.4}}
\newlabel{id2}{{4}{5}{To prove Identity~\ref {idn2}, condition on the location of the last square}{figure.4}{}}
\newlabel{idn3}{{4}{6}{}{theorem.4}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces To see Identity\nobreakspace  {}\ref  {idn3}, count the $(m+n)$-tilings based on breakability at cell $m$.}}{6}{figure.5}}
\newlabel{id3}{{5}{6}{To see Identity~\ref {idn3}, count the $(m+n)$-tilings based on breakability at cell $m$}{figure.5}{}}
\newlabel{idn4}{{5}{6}{}{theorem.5}{}}
\citation{B}
\citation{G}
\citation{BQ}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces To see Identity\nobreakspace  {}\ref  {idn4}, consider all of the vertical dominoes.}}{7}{figure.6}}
\newlabel{id4}{{6}{7}{To see Identity~\ref {idn4}, consider all of the vertical dominoes}{figure.6}{}}
\newlabel{eq1}{{2}{7}{Some combinatorial identities}{equation.2.2}{}}
\newlabel{eq2}{{3}{7}{Some combinatorial identities}{equation.2.3}{}}
\newlabel{eq3}{{4}{7}{Some combinatorial identities}{equation.2.4}{}}
\citation{KS}
\citation{BQ}
\citation{BQ}
\bibcite{BPS}{1}
\bibcite{BQ}{2}
\bibcite{B}{3}
\bibcite{G}{4}
\bibcite{KS}{5}
\bibcite{ML}{6}
\bibcite{S}{7}
\@writefile{toc}{\contentsline {section}{\numberline {3}Concluding remarks}{8}{section.3}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Acknowledgments}{8}{section.4}}