The maximal determinant of order 15 over the third roots of unity
Abstract
We prove that the largest absolute determinant of a 15×15 matrix with entries in {1,ω,ω2}, where ω3=1 and ω≠1, is 120932352√(19). A matrix attaining this value was already known; the issue is maximality. The proof follows the Gram-matrix search method used in the real maximal-determinant problem. A sharp determinant bound in terms of the off-diagonal Gram energy, combined with Eisenstein congruences and a published classification of difference matrices, reduces a strict improvement to 23 possible energies. Componentwise Schur bounds and exact support catalogues then leave a small number of cases, excluded by orthogonality, rank, and spectral-intertwining conditions. We present the finite tests in a common framework and supply their replay programs. For the displayed extremizer we give a dephased representative, its Gram matrix and spectrum, and an exact computation of its monomial automorphism group, which has order 1008. The proof determines the value of the maximum, but does not classify all equality cases.
Related
- Colored Khovanov homology theories at prime roots of unity
- Gelfand--Tsetlin bases for representations of Uq(gln) at roots of unity
- Zeros and Roots of Unity for Characters of Solvable Groups
- PGL2 webs at roots of unity
- Small sums of roots of unity: polylogarithmic exceptional sets and conditional separation
BibTeX
@misc{dong2026maximal,
title = {{The maximal determinant of order 15 over the third roots of unity}},
author = {Daoyu Dong},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40679},
eprint = {2610.40679},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40679},
}
RIS
TY - UNPB
TI - The maximal determinant of order 15 over the third roots of unity
AU - Daoyu Dong
PY - 2026
DA - 2026/10/25
PB - arXiv
DO - 10.48550/arxiv.2610.40679
UR - https://arxiv.org/abs/2610.40679
AB - We prove that the largest absolute determinant of a 15×15 matrix with entries in {1,ω,ω^2}, where ω^3=1 and ω≠1, is 120932352√(19). A matrix attaining this value was already known; the issue is maximality. The proof follows the Gram-matrix search method used in the real maximal-determinant problem. A sharp determinant bound in terms of the off-diagonal Gram energy, combined with Eisenstein congruences and a published classification of difference matrices, reduces a strict improvement to 23 possible energies. Componentwise Schur bounds and exact support catalogues then leave a small number of cases, excluded by orthogonality, rank, and spectral-intertwining conditions. We present the finite tests in a common framework and supply their replay programs. For the displayed extremizer we give a dephased representative, its Gram matrix and spectrum, and an exact computation of its monomial automorphism group, which has order 1008. The proof determines the value of the maximum, but does not classify all equality cases.
ER -