arXiv:1306.0616 [math.CO]AbstractReferencesReviewsResources
Asymptotic enumeration of magic series
Published 2013-06-03Version 1
A magic series is a set of natural numbers that, by virtue of its size, sum, and maximum value, could fill a row of a normal magic square. In this paper, we derive an exact two-dimensional integral representation for the number of magic series of order N. By applying the stationary phase approximation, we develop an expansion in powers of 1/N for the number of magic series and calculate the first few terms. We find excellent agreement between our approximation and the known exact values. Related results are presented for magic cube and hypercube series, bimagic series, and trimagic series.
Related articles: Most relevant | Search more
arXiv:1401.7381 [math.CO] (Published 2014-01-29)
Asymptotic enumeration of sparse connected 3-uniform hypergraphs
arXiv:2010.12969 [math.CO] (Published 2020-10-24)
Asymptotic Enumeration of Binary Contingency Tables and Comparison with Independent Heuristic
Sum of squares of degrees in a graph