Reduce the grid matrix
Show an integral equivalence between the signed matching matrix and a structured Kronecker-sum operator.
← All researchMF-PRISM-MATH-2026-17 / interactive guide
THE IDEA, MADE VISIBLE
Move the domino. Keep the odd factor.
Test a common divisor across single-domino positions on small even squares.
Candidate resolutionA Universal Odd Divisor for Single-Domino Constraints
Factor the full count
The familiar even-square count has the form 2ᵐb² with b odd. For the displayed 2, 4 and 6 side lengths, b is 1, 3 and 29 respectively.
- Odd divisor b
- 29
- Required count
- 1276
- Forbidden count
- 5452
At this 6×6 position, both 1,276 and 5,452 are divisible by 29. Only one location is constrained.
T = 2ᵐb²; inspect T(required) mod b and T(forbidden) mod b
TRY THIS
Use the 6×6 board and move the position slider. Both single-location counts remain divisible by 29.
What this experiment represents. Exact single-location counts for 2×2, 4×4 and 6×6 squares. Small-board remainder checks are not a proof of the universal divisibility assertion or its integral matrix argument.
Mathematics · Preprint
A Universal Odd Divisor for Single-Domino Constraints
Pachter’s divisibility assertion beyond the step diagonal
Candidate resolutionMF-PRISM-MATH-2026-17 / v0.2
Identifies a common odd divisor retained when any one domino location is required or forbidden on an even square board. Integral matrix reduction separates odd denominators from the remaining factor of two.
- Identifier
- MF-PRISM-MATH-2026-17
- Series
- Mathematics
- Edition
- Version 0.2
- Length
- 10 pages
- Reserved DOI
- 10.5281/zenodo.22728344 (record reserved)
01
Plain-language guide
3 minute explanation
What this paper is really saying.
The paper proposes that every single domino position on an even square board shares one common odd divisibility factor, whether that domino is required or forbidden.
domino tilingsdivisibilityintegral matrices
A constrained tiling count changes when one domino is forced or removed. The claim is that, despite the location-dependent count, the same odd number still divides every one of those single-location counts.
The argument converts the grid matching matrix into a Kronecker-sum operator, separates symmetric and alternating components in characteristic two, and controls the odd denominators that appear in inverse entries.
02
How it works
The argument, without the notation.
The paper’s technical details matter, but the basic route can be understood in three moves.
Control parity and denominators
Use symmetric/alternating decomposition and cyclicity in characteristic two to isolate the odd divisor.
Recover edge counts
Relate inverse entries to the sign-correct counts for requiring or forbidding one domino location.
03
What it adds
The useful takeaways.
A universal odd divisor is proposed for every single domino position on an even square board.
The same divisor applies to both the required and forbidden version of a single constraint.
The theorem deliberately excludes simultaneous multiple constraints.
04
Scope & limits
What this does—and does not—establish.
Current status
Candidate divisibility theorem for every single-domino position; simultaneous multiple constraints are outside the claim.
This manuscript presents a candidate resolution. Publication is not verification: independent specialist review remains necessary before the result should be treated as established.
Only one constrained domino position is covered at a time.
The result is stated for even square boards, not arbitrary regions.
Multiple simultaneous requirements or prohibitions may behave differently and are not claimed.
05
Why it matters
Why anyone should care.
The theorem would extend the divisibility phenomenon from a special diagonal to every single location while sharply excluding simultaneous multi-constraint cases.
06
Key terms
The vocabulary, decoded.
These are the terms needed to understand the claim. The full paper uses them more precisely.
Odd divisor
A divisor with no factor of two.
Kronecker sum
A structured matrix sum built from smaller matrices using tensor products.
Integral equivalence
A transformation by invertible integer matrices that preserves key arithmetic data.
Characteristic two
Parity arithmetic where adding an element to itself gives zero.
07
Independent review
Where scrutiny should concentrate.
The strongest review is not a general reaction. It tests the steps most capable of changing the conclusion.
- 01Integral equivalence of the signed grid matrix and the Kronecker-sum operator.
- 02Symmetric/alternating decomposition, cyclicity in characteristic two, and denominator control.
- 03Sign-correct single-edge counts, exact scope of Pachter’s assertion, and exclusions for multiple simultaneous constraints.
Publication record
Go from explanation to evidence.
This page is a reading guide, not a substitute for the manuscript. The public record links the explanation to the paper, source package, review materials, and persistent identifier.
- Document
- Preprint
- Review status
- Open for independent review
- Published
- 2026-09-12
- DOI status
- Reserved · 10.5281/zenodo.22728344
- Canonical record
- MF-PRISM-MATH-2026-17
Metriq PRISM Laboratory, A Universal Odd Divisor for Single-Domino Constraints, Metriq PRISM Laboratory Mathematics Research Paper MF-PRISM-MATH-2026-17, Version 0.2, 2026. Corresponding contributor: Daniel H. Jeffery, ORCID 0009-0001-1200-6042. DOI: 10.5281/zenodo.22728344.