arXiv Analytics

Sign in

arXiv:math/0409468 [math.CO]AbstractReferencesReviewsResources

Constructing All Magic Squares of Order Three

Guoce Xin

Published 2004-09-24Version 1

We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.

Comments: 7 pages
Categories: math.CO, math.NT
Subjects: 05A15, 11P21
Related articles: Most relevant | Search more
arXiv:0902.2444 [math.CO] (Published 2009-02-14)
A combinatorial proof of a formula for Betti numbers of a stacked polytope
arXiv:1502.07674 [math.CO] (Published 2015-02-26)
Another combinatorial proof of a result of Zagier and Stanley
arXiv:1606.04137 [math.CO] (Published 2016-06-13)
Combinatorial proof of the transcendence of $L(1,χ_s)/Π$

Links

Toolbox