Linear Type-p Most-Perfect Squares
Combinatorics
2017-12-29 v1
Abstract
We describe a generalization of most-perfect magic squares, called type-p most-perfect squares, and in prime-power orders we give a linear construction of these squares reminiscent of de la Loubere's classical magic square construction method. Type-p most-perfect squares can be used to construct other interesting squares (e.g., generalized Franklin squares) and our linear construction may have implications for counting type-p most-perfect squares.
Cite
@article{arxiv.1712.09600,
title = {Linear Type-p Most-Perfect Squares},
author = {John Lorch},
journal= {arXiv preprint arXiv:1712.09600},
year = {2017}
}
Comments
10 pages