betaFeedback

WorksMathematics

The edge sums of seven double-six domino frames

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. An exact-cover recurrence proves completeness, and a physical arrangement certifies each list.

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 [1].

Theorem 1.1. There are exactly 10,821 different sorted seven-term edge-sum lists. Grouping by the smallest sum gives

smallest sum23456
attainable lists3323272127211511545

Proof. Let the four corner pips in cyclic order be a0,…,a3a_0,\ldots,a_3. For a common edge sum ss, the intermediate pips must be bi=s−ai−ai+1b_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 {ai,bi}\{a_i,b_i\}, retaining doubles. Enumerate s=0,…,18s=0,\ldots,18 and the 747^4 corner choices. Keep 0≤bi≤60\le b_i\le6 and four distinct dominoes. This gives exactly 1,070 different pairs (M,s)(M,s) of four-domino masks and edge sums. Conversely each retained pair has a physical realization.

The authors acknowledge assistance from OpenAI Codex in mathematical exploration, checking, and manuscript preparation. OpenAI Codex drafted the proof and ran the accompanying checks.

For a remaining domino set UU, let G(U)G(U) be the set of attainable sum histograms. Start with G(∅)={0}G(\varnothing)=\{0\}. Choose any i∈Ui \in U and take the union of {es+v:v∈G(U∖M)}\{e_s+v:v \in G(U \setminus M)\} over all retained (M,s)(M,s) with i∈M⊆Ui \in M \subseteq U. The frame containing ii 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↦18−ss \mapsto18-s on the complete answer set. □\square

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.

sum16131210662
corners4656456636452455223300210102

Table 1.

The supplementary file 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 domino.py reproduces the exhaustive count, and domino_certificates.py checks every physical arrangement.

References

References

  1. [1]daw, Number of arrangements of dominos into squares with equal edge sum, Mathematics Stack Exchange, question 5149342.

Paper details

vlnc:W_at7rxc28
Version
v1 · latest
Published
Fresh — published within the last 30 days
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents