Jan 14 2009
“A Systematic Approach to Filling m-by-n Numerical Arrays” by G. Stolyarov II | The Rational Argumentator
The Rational Argumentator
A Journal for Western Man
Principal Index *** Contributors *** Yahoo! Group
A Systematic Approach to Filling m-by-n Numerical Arrays
G. Stolyarov II
Issue CLXXXIV - January 14, 2009
This is an original mathematical work which has occupied much of Mr. Stolyarov’s attention in 2008. With the assistance of Dr. David Murphy, Mr. Stolyarov arrived at some new insights regarding the filling of a special kind of numerical puzzle – the m-by-n array. In the process, Mr. Stolyarov has developed a new kind of notation that makes the expression of sums of terms and compositions of summations much more concise.
The entirety of Mr. Stolyarov’s paper can be read and downloaded here.
Mr. Stolyarov also created an interactive presentation to accompany this paper. The presentation contains a variety of diagrams, examples, and illustrations of Mr. Stolyarov’s work on filling numerical arrays. If you would like to use Mr. Stolyarov’s presentation for your own lectures or simply your studies and enjoyment, you may download it here.
Abstract
This paper develops a systematic way to fill any m-by-n numerical array where the row and column constraints are specified and the sum of the row constraints is equal to the sum of the column constraints. This problem has both relevance, due to the growing interest in numerical puzzles, and applications, especially to the field of algebraic geometry. In this paper, it is shown that any m-by-n numerical array with the given specifications can be filled, and a directional row-by-row filling algorithm is developed for doing so. However, many of even the simplest numerical arrays have multiple possible fillings, and we seek to arrive at a way of finding how many fillings any given array has. We develop a formula for the number of fillings for m-by-d arrays, where d is the sum of the row constraints and the sum of the column constraints, and each column constraint is equal to 1. Then we proceed to find formulas for the number of fillings for 2-by-2, 2-by-3, 2-by-4, 2-by-n, 3-by-3, and 3-by-n arrays. In the process, we develop the necessary techniques, insights, and notation to enable us to develop a formula for the number of fillings for a general m-by-n array.
___________
G. Stolyarov II is a science fiction novelist, independent philosophical essayist, poet, amateur mathematician, composer, contributor to Enter Stage Right, Le Quebecois Libre, Rebirth of Reason, and the Ludwig von Mises Institute, Senior Writer for The Liberal Institute, former weekly columnist for GrasstopsUSA.com, and Editor-in-Chief of The Rational Argumentator, a magazine championing the principles of reason, rights, and progress. Mr. Stolyarov’s new blog, The Progress of Liberty, offers a combination of commentary, multimedia presentations, educational materials, and suggestions for effective activism in favor of individual freedom. Mr. Stolyarov also publishes his articles on Helium.com and Associated Content to assist the spread of rational ideas. He holds the highest Clout Level (10) possible on Associated Content. Mr. Stolyarov has also written a science fiction novel, Eden against the Colossus, a non-fiction treatise, A Rational Cosmology, and a play, Implied Consent. He has made YouTube Videos since the beginning of 2008, which have been watched over 26,000 times to date. Mr. Stolyarov can be contacted at gennadystolyarovii@yahoo.com.
This TRA feature has been edited in accordance with TRA’s Statement of Policy.
Click here to return to TRA’s Issue CLXXXIV Index.
Well, here I am correcting myself.
I’m afraid that in this paper I suggest that it only takes two sequences at most to generate all of the PPTs with a certain leg difference (2n^2 - m^2). Actually, multiple pairs of n and m could give the same difference, and each pair would give two sequences of PPT generators. For example,
n=8, m=3 and n=10, m=9 both give the leg difference of 119.
Also, I inadvertently imply that each Nominator, n, is matched with only one Modifier, m. Actually, each Nominator has a number of permissible Modifiers (any odd number less and relatively prime to the Nominator).
Okay, that’s it!
Sorry.
Keith
Sorry, the above reply is for my article below, the one on Pythagorean triples.