Tensor constructions for Euler magic matrices and proper examples of orders 9, 27, 81 and 243
Abstract
An Euler magic matrix is an integer matrix M satisfying MMT=γI together with two diagonal square-sum conditions; it is proper when its entry squares are pairwise distinct. M{ü}ller proved that Euler magic matrices exist in every order other than $3$, and that no Euler magic matrix of order $3$ exists at all, while proper examples are considerably more restrictive. We describe a tensor construction whose factors are only required to satisfy the orthogonality equation AAT=γI: for a linear reindexing L of the row index group 𝔽3k obeying an explicit support condition, the reindexed Kronecker product of k such 3×3 factors satisfies the full Euler magic conditions in order 3k. Choosing factors whose entry squares have pairwise distinct products, we obtain proper Euler magic matrices of orders $9$, $27$, $81$ and $243$. The construction therefore produces proper examples in powers of three even though order three admits no Euler magic matrix, and the passage from the factors to the product is exactly where the Euler conditions are created rather than inherited. We give an explicit support condition on L and show that it characterises the linear reindexings forcing the two Euler diagonal identities for every tuple of semi-magic factor arrays; over 𝔽p with two factors, such a reindexing exists only when p≤3. The four existence results are formalised in Lean 4, as are the two instances of the construction used to obtain them; the order-$243$ certificate is taken from the archived development and was not rebuilt in preparing this paper, although its witness was reproduced here by exact integer arithmetic. Further proper examples of orders $729$ and $2187$ are verified by exact integer computation only.
Related
- Characteristic identities for orthogonal quantum matrices: examples
- From Matrices to Morphisms II: Examples of Computational Categories in MATLAB and Octave
- From Unit Interval Orders to Totally Nonnegative Matrices: Permanental Inequalities and Bruhat-Increasing Bijections
- Fast tensor transforms and ring-valued orthogonal matrices: an application to cryptography
- Limiting moments of sample covariance matrices from large fold tensor vectors
BibTeX
@misc{mehat2026tensor,
title = {{Tensor constructions for Euler magic matrices and proper examples of orders 9, 27, 81 and 243}},
author = {Sanjit Singh Mehat},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05530},
eprint = {2609.05530},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05530},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Tensor constructions for Euler magic matrices and proper examples of orders 9, 27, 81 and 243
AU - Sanjit Singh Mehat
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.05530
UR - https://arxiv.org/abs/2609.05530
AB - An Euler magic matrix is an integer matrix M satisfying MM^T=γI together with two diagonal square-sum conditions; it is proper when its entry squares are pairwise distinct. M{ü}ller proved that Euler magic matrices exist in every order other than $3$, and that no Euler magic matrix of order $3$ exists at all, while proper examples are considerably more restrictive. We describe a tensor construction whose factors are only required to satisfy the orthogonality equation AA^T=γI: for a linear reindexing L of the row index group 𝔽_3^k obeying an explicit support condition, the reindexed Kronecker product of k such 3×3 factors satisfies the full Euler magic conditions in order 3^k. Choosing factors whose entry squares have pairwise distinct products, we obtain proper Euler magic matrices of orders $9$, $27$, $81$ and $243$. The construction therefore produces proper examples in powers of three even though order three admits no Euler magic matrix, and the passage from the factors to the product is exactly where the Euler conditions are created rather than inherited. We give an explicit support condition on L and show that it characterises the linear reindexings forcing the two Euler diagonal identities for every tuple of semi-magic factor arrays; over 𝔽_p with two factors, such a reindexing exists only when p≤3. The four existence results are formalised in Lean 4, as are the two instances of the construction used to obtain them; the order-$243$ certificate is taken from the archived development and was not rebuilt in preparing this paper, although its witness was reproduced here by exact integer arithmetic. Further proper examples of orders $729$ and $2187$ are verified by exact integer computation only.
ER -