\documentclass[11pt,letterpaper,twoside,reqno]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern,amsmath,amssymb,booktabs,graphicx} \usepackage[margin=1in]{geometry} \usepackage[hidelinks,unicode]{hyperref} \hypersetup{pdftitle={The edge sums of seven double-six domino frames}, pdfauthor={Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer}, pdfsubject={Mathematical research note},pdfkeywords={double-six domino, edge sum, exact cover, enumeration}} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newcommand{\topic}[2]{\section{#2}\label{r#1}} \newcommand{\src}[2]{\href{#1}{#2}} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\ord}{\operatorname{ord}} \newcommand{\dd}{\mathop{}\!\mathrm d} \newcommand{\stir}[2]{\genfrac{[}{]}{0pt}{}{#1}{#2}} \title[The edge sums of seven domino frames]{The edge sums of seven double-six domino frames} \author[W. Howe]{Will Howe} \author[G. Huffman]{Grant Huffman} \author[J. Kohlmeyer]{Jensen Kohlmeyer} \author[L. Kruer]{Liam Kruer} \date{November 19, 2026} \subjclass[2020]{05A15} \keywords{double-six domino, edge sum, exact cover, enumeration} \thanks{The authors acknowledge assistance from OpenAI Codex in mathematical exploration, checking, and manuscript preparation. OpenAI Codex drafted the proof and ran the accompanying checks.} \begin{document} \begin{abstract} Partition the 28 double-six dominoes into seven square frames. When the four edge sums of each frame agree, exactly 10,821 sorted lists of the seven sums are attainable. We enumerate every admissible frame, prove completeness by an exact-cover recurrence, and provide a physical witness for every list. \end{abstract} \maketitle \section{Enumeration of the edge-sum lists} Use each of the 28 double-six dominoes once to tile the borders of seven \(3\)-by-\(3\) squares. Within every border, the three pips along any side must have the same sum \cite{domino}. \begin{theorem}There are exactly \(\mathbf{10,821}\) different sorted seven-term edge-sum lists. Grouping by the smallest sum gives \[ \begin{array}{c|rrrrr} \textnormal{smallest sum}&2&3&4&5&6\\ \hline \textnormal{attainable lists}&3323&2721&2721&1511&545 \end{array} \] \end{theorem} \begin{proof}Let the four corner pips in cyclic order be \(a_0,\ldots,a_3\). For a common edge sum \(s\), the intermediate pips must be \(b_i=s-a_i-a_{i+1}\), cyclically. Choose the clockwise orientation of the frame by reflection if necessary. Each domino is then the unordered pair \(\{a_i,b_i\}\), retaining doubles. Enumerate \(s=0,\ldots,18\) and the \(7^4\) corner choices. Keep \(0\le b_i\le6\) and four distinct dominoes. This gives exactly 1,070 different pairs \((M,s)\) of four-domino masks and edge sums. Conversely each retained pair has a physical realization. \newpage For a remaining domino set \(U\), let \(G(U)\) be the set of attainable sum histograms. Start with \(G(\varnothing)=\{0\}\). Choose any \(i\in U\) and take the union of \(\{e_s+v:v\in G(U\setminus M)\}\) over all retained \((M,s)\) with \(i\in M\subseteq U\). The frame containing \(i\) proves both directions of the recurrence. On all 28 dominoes it gives the table. The supplied program independently regenerates frames by closing walks of four oriented dominoes, repeats the covering recursion with a different pivot order, and checks reflection \(s\mapsto18-s\) on the complete answer set. \end{proof} \smallskip\noindent\textit{Constructive certificates.} For the sum list in the question, the following seven frames give one physical arrangement. Each four-digit word lists its clockwise corner pips. \[ \begin{array}{r|rrrrrrr} \textnormal{sum} &16&13&12&10&6&6&2\\ \textnormal{corners} &4656&4566&3645&2455&2233&0021&0102 \end{array} \] The supplementary file \texttt{domino-certificates.json} gives seven frame indices for each sum list. A frame is encoded by its sum and its four clockwise corner pips. Put the three supplementary files in one directory. Running \texttt{domino.py} reproduces the exhaustive count, and \texttt{domino\_certificates.py} checks every physical arrangement. \begin{thebibliography}{9}\small \bibitem{domino} daw, \emph{Number of arrangements of dominos into squares with equal edge sum}, Mathematics Stack Exchange, \src{https://math.stackexchange.com/questions/5149342}{question 5149342}. \end{thebibliography} \end{document}