Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Enumeration of $4 \times 4$ magic squares
HTML articles powered by AMS MathViewer

by Matthias Beck and Andrew van Herick PDF
Math. Comp. 80 (2011), 617-621 Request permission

Abstract:

A magic square is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the $n=3$ case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane arrangements and Ehrhart’s theory of lattice-point enumeration.
References
  • Maya Ahmed, Jesús De Loera, and Raymond Hemmecke, Polyhedral cones of magic cubes and squares, Discrete and computational geometry, Algorithms Combin., vol. 25, Springer, Berlin, 2003, pp. 25–41. MR 2038468, DOI 10.1007/978-3-642-55566-4_{2}
  • A. I. Barvinok, Computing the Ehrhart polynomial of a convex lattice polytope, Discrete Comput. Geom. 12 (1994), no. 1, 35–48. MR 1280575, DOI 10.1007/BF02574364
  • Matthias Beck, Moshe Cohen, Jessica Cuomo, and Paul Gribelyuk, The number of “magic” squares, cubes, and hypercubes, Amer. Math. Monthly 110 (2003), no. 8, 707–717. MR 2023999, DOI 10.2307/3647853
  • Matthias Beck and Sinai Robins, Computing the continuous discretely, Undergraduate Texts in Mathematics, Springer, New York, 2007. Integer-point enumeration in polyhedra. MR 2271992
  • Matthias Beck and Thomas Zaslavsky, Six little squares and how their numbers grow, Preprint, 2005.
  • Matthias Beck and Thomas Zaslavsky, An enumerative geometry for magic and magilatin labellings, Ann. Comb. 10 (2006), no. 4, 395–413. MR 2293647, DOI 10.1007/s00026-006-0296-4
  • Matthias Beck and Thomas Zaslavsky, Inside-out polytopes, Adv. Math. 205 (2006), no. 1, 134–162. MR 2254310, DOI 10.1016/j.aim.2005.07.006
  • Schuyler Cammann, Old Chinese magic squares, Sinologica 7 (1962), 14–53.
  • —, Islamic and Indian magic squares, Parts I and II, History of Religions 8 (1969), 181–209; 271–299.
  • Eugène Ehrhart, Sur les polyèdres rationnels homothétiques à $n$ dimensions, C. R. Acad. Sci. Paris 254 (1962), 616–618 (French). MR 130860
  • Eugène Ehrhart, Sur les carrés magiques, C. R. Acad. Sci. Paris Sér. A-B 277 (1973), A651–A654 (French). MR 332532
  • Komei Fukuda, Software package cdd, (2008. Electronically available at http://www. ifor.math.ethz.ch/$\sim$fukuda/cdd home/cdd.html).
  • Andrew Van Herick, Theoretical and computational methods for lattice point enumeration in inside-out polytopes, MA thesis, San Francisco State University, 2007. Available at http://math.sfsu.edu/beck/teach/masters/andrewv.pdf. Software package IOP available at http://iop.sourceforge.net/.
  • Vincent Loechner, Software package polylib, (2007. Electronically available at http://icps.u-strasbg.fr/polylib/).
  • Percy A. MacMahon, Combinatory analysis, Chelsea Publishing Co., New York, 1960. Two volumes (bound as one). MR 0141605
  • Richard P. Stanley, Linear homogeneous Diophantine equations and magic labelings of graphs, Duke Math. J. 40 (1973), 607–632. MR 317970
  • Richard P. Stanley, Enumerative combinatorics. Vol. 1, Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge University Press, Cambridge, 1997. With a foreword by Gian-Carlo Rota; Corrected reprint of the 1986 original. MR 1442260, DOI 10.1017/CBO9780511805967
  • The PARI Group, Bordeaux, PARI/GP, version 2.3.4, 2008, available from http://pari.math.u-bordeaux.fr/.
  • Sven Verdoolaege, Software package barvinok, (2004. Electronically available at http://freshmeat.net/projects/barvinok/).
  • Guoce Xin, Constructing all magic squares of order three, Discrete Math. 308 (2008), no. 15, 3393–3398. MR 2423421, DOI 10.1016/j.disc.2007.06.022
  • Claudia Zaslavsky, Africa counts, Prindle, Weber & Schmidt, Inc., Boston, Mass., 1973. Number and pattern in African culture. MR 0504588
Similar Articles
Additional Information
  • Matthias Beck
  • Affiliation: Department of Mathematics, San Francisco State University, San Francisco, California 94132
  • MR Author ID: 650249
  • Email: beck@math.sfsu.edu
  • Andrew van Herick
  • Affiliation: 531 Beloit Avenue, Kensington, California 94708
  • Email: avanherick@gmail.com
  • Received by editor(s): August 11, 2009
  • Received by editor(s) in revised form: August 30, 2009
  • Published electronically: March 29, 2010
  • Additional Notes: We thank a referee and an associate editor for helpful comments on an earlier version of this paper. We are grateful to San Francisco State University’s Center for Computing and Life Sciences for graciously offering the use of their resources. This research was partially supported by the NSF (research grant DMS-0810105).
  • © Copyright 2010 American Mathematical Society
  • Journal: Math. Comp. 80 (2011), 617-621
  • MSC (2010): Primary 05A15, 05C78, 52B20, 52C35, 68R05
  • DOI: https://doi.org/10.1090/S0025-5718-10-02347-1
  • MathSciNet review: 2728997