Generalized most-perfect squares

MaRDI QIDQ5224751zbMATH OpenFDO

Authors John Lorch

Publication date 24 July 2019

Full work available at URL https://arxiv.org/abs/1712.09600

zbMATH Keywords

generalized Franklin squarestype-\(p\) most-perfect squares

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30)

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.

Recommendations

• scientific article; zbMATH DE number 1354283
• On systematic procedures for constructing magic squares
• scientific article; zbMATH DE number 1354831
• On Franklin and complete magic square matrices
• Pandiagonal Type-p Franklin Squares

Cited in

(3)

• scientific article; zbMATH DE number 4183595 (Why is no real title available?)
• Pandiagonal Type-p Franklin Squares
• The existence of irrational most perfect magic squares

This page was built for publication: Generalized most-perfect squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224751)