\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{OEIS}
\citation{nrich}
\HyPL@Entry{0<</S/D>>}
\citation{Gardner}
\citation{Kot}
\citation{pawns}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{2}{section.1}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Square arrays}{2}{section.2}}
\newlabel{section_two}{{2}{2}{Square arrays}{section.2}{}}
\newlabel{lower_bd_sq}{{1}{2}{}{theorem.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces The first four square arrays.\relax }}{3}{figure.caption.1}}
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
\newlabel{fig:1}{{1}{3}{The first four square arrays.\relax }{figure.caption.1}{}}
\newlabel{L-thm}{{2}{3}{}{theorem.2}{}}
\newlabel{cor1}{{3}{3}{}{theorem.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The coloring argument for even-sided squares. \relax }}{4}{figure.caption.2}}
\newlabel{fig:colarg}{{2}{4}{The coloring argument for even-sided squares. \relax }{figure.caption.2}{}}
\newlabel{7-pr}{{4}{4}{}{theorem.4}{}}
\newlabel{fig:2a}{{3a}{4}{Restrictions for $n=7$.\relax }{figure.caption.3}{}}
\newlabel{sub@fig:2a}{{a}{4}{Restrictions for $n=7$.\relax }{figure.caption.3}{}}
\newlabel{fig:2b}{{3b}{4}{A solution with 29 diagonals for $n=7$.\relax }{figure.caption.3}{}}
\newlabel{sub@fig:2b}{{b}{4}{A solution with 29 diagonals for $n=7$.\relax }{figure.caption.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The $n=7$ case.\relax }}{4}{figure.caption.3}}
\newlabel{fig:2}{{3}{4}{The $n=7$ case.\relax }{figure.caption.3}{}}
\newlabel{pr-6n}{{5}{5}{}{theorem.5}{}}
\newlabel{fig:17constr}{{4a}{5}{Construction for $n=17$.\relax }{figure.caption.4}{}}
\newlabel{sub@fig:17constr}{{a}{5}{Construction for $n=17$.\relax }{figure.caption.4}{}}
\newlabel{fig:13constr}{{4b}{5}{Construction for $n=13$.\relax }{figure.caption.4}{}}
\newlabel{sub@fig:13constr}{{b}{5}{Construction for $n=13$.\relax }{figure.caption.4}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces The $n=17$ and $n=13$ cases.\relax }}{5}{figure.caption.4}}
\newlabel{fig:13_17}{{4}{5}{The $n=17$ and $n=13$ cases.\relax }{figure.caption.4}{}}
\newlabel{odd_bd}{{6}{6}{}{theorem.6}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Rectangular arrays}{7}{section.3}}
\newlabel{section_three}{{3}{7}{Rectangular arrays}{section.3}{}}
\citation{OEIS}
\citation{ibm}
\citation{OEIS}
\citation{OEIS}
\newlabel{even_side}{{9}{8}{}{theorem.9}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Search algorithms}{8}{subsection.3.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Computed values of $D(n,m)$. Values in cells without all four borders and with numbers in small font are conjectures; other values are verified maxima for the given dimensions. Colors indicate the number of extra diagonals that the array can accommodate above the L-arrangement.\relax }}{9}{figure.caption.5}}
\newlabel{fig:compres}{{5}{9}{Computed values of $D(n,m)$. Values in cells without all four borders and with numbers in small font are conjectures; other values are verified maxima for the given dimensions. Colors indicate the number of extra diagonals that the array can accommodate above the L-arrangement.\relax }{figure.caption.5}{}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Number of optimal solutions for rectangular arrays. Arrangements that can be rotated and/or reflected into each other are counted as distinct.\relax }}{10}{table.caption.6}}
\newlabel{numsol}{{1}{10}{Number of optimal solutions for rectangular arrays. Arrangements that can be rotated and/or reflected into each other are counted as distinct.\relax }{table.caption.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Some computed solutions for the $11 \times 11$ array. Instead of showing each diagonal, cells that have a positive diagonal are colored red, while cells with a negative diagonal are blue.\relax }}{10}{figure.caption.7}}
\newlabel{fig:11sols}{{6}{10}{Some computed solutions for the $11 \times 11$ array. Instead of showing each diagonal, cells that have a positive diagonal are colored red, while cells with a negative diagonal are blue.\relax }{figure.caption.7}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces A braided solution for a $ 21 \times 11$ array. Arrows show the entry and exit points of the red (positive diagonals) and blue (negative diagonals) threads.\relax }}{11}{figure.caption.8}}
\newlabel{fig:braidex}{{7}{11}{A braided solution for a $ 21 \times 11$ array. Arrows show the entry and exit points of the red (positive diagonals) and blue (negative diagonals) threads.\relax }{figure.caption.8}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Braided solutions}{11}{subsection.3.2}}
\newlabel{sec_braids}{{3.2}{11}{Braided solutions}{subsection.3.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Feasibility of the braid construction}{13}{subsection.3.3}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces A braided solution for a $ 35 \times 29$ array. The first reduction yields the reduced solution in the yellow box, while the second yields the one in the black box. \relax }}{15}{figure.caption.9}}
\newlabel{fig:redconst}{{8}{15}{A braided solution for a $ 35 \times 29$ array. The first reduction yields the reduced solution in the yellow box, while the second yields the one in the black box. \relax }{figure.caption.9}{}}
\newlabel{formula}{{13}{15}{}{theorem.13}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Three-dimensional arrays}{16}{section.4}}
\newlabel{section_four}{{4}{16}{Three-dimensional arrays}{section.4}{}}
\newlabel{3dupbd}{{14}{17}{}{theorem.14}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The number of different types of lattice points in a $2n \times 2m \times 2k, \tmspace  +\thickmuskip {.2777em} n\leq m \leq k$ array.\relax }}{17}{table.caption.10}}
\newlabel{table2}{{2}{17}{The number of different types of lattice points in a $2n \times 2m \times 2k, \; n\leq m \leq k$ array.\relax }{table.caption.10}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Seven space diagonals in a $2 \times 2 \times 2$ cube. Circles denote the lower endpoint of a diagonal at level $i$, while their upper endpoint at level $i+1$ is marked by an x. \relax }}{18}{figure.caption.11}}
\newlabel{fig:222}{{9}{18}{Seven space diagonals in a $2 \times 2 \times 2$ cube. Circles denote the lower endpoint of a diagonal at level $i$, while their upper endpoint at level $i+1$ is marked by an x. \relax }{figure.caption.11}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces 44 diagonals in a $4 \times 4 \times 4$ cube.\relax }}{19}{figure.caption.12}}
\newlabel{fig:444}{{10}{19}{44 diagonals in a $4 \times 4 \times 4$ cube.\relax }{figure.caption.12}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Two-layer arrays}{21}{subsection.4.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {11}{\ignorespaces Middle level of a $5\times 5\times 2$ array that contains a total of 36 diagonals. The downward diagonals are depicted in green on the left, while upward diagonals are shown in purple on the right. A small circle denotes the lattice point at which each diagonal originates.\relax }}{22}{figure.caption.13}}
\newlabel{fig:2l55}{{11}{22}{Middle level of a $5\times 5\times 2$ array that contains a total of 36 diagonals. The downward diagonals are depicted in green on the left, while upward diagonals are shown in purple on the right. A small circle denotes the lattice point at which each diagonal originates.\relax }{figure.caption.13}{}}
\bibcite{nrich}{1}
\bibcite{Gardner}{2}
\bibcite{ibm}{3}
\bibcite{pawns}{4}
\bibcite{Kot}{5}
\bibcite{OEIS}{6}
\@writefile{lof}{\contentsline {figure}{\numberline {12}{\ignorespaces Middle level of a $4\times 6\times 2$ array that contains a total of 35 diagonals. The downward diagonals are depicted in green on the left, while upward diagonals are shown in purple on the right. A small circle denotes the lattice point at which each diagonal originates.\relax }}{23}{figure.caption.14}}
\newlabel{fig:2l46}{{12}{23}{Middle level of a $4\times 6\times 2$ array that contains a total of 35 diagonals. The downward diagonals are depicted in green on the left, while upward diagonals are shown in purple on the right. A small circle denotes the lattice point at which each diagonal originates.\relax }{figure.caption.14}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Open questions}{23}{section.5}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Acknowledgments}{23}{section.6}}