AbstractMagic rectangles are a generalization of magic squares that have been recently investigated by Bier and Rogers (European J. Combin. 14 (1993) 285–299); and Bier and Kleinschmidt (Discrete Math. 176 (1997) 29–42). In this paper, we present a new, simplified proof of the necessary and sufficient conditions for a magic rectangle to exist. We also show that magic rectangles, under the natural multiplication, have a unique factorization as a product of irreducible magic rectangles
In this work, magic squares are written with equal and unequal sums blocks of \textbf{magic rectangl...
The author worked on different kinds of magic squares. These include block-wise, bordered, block-bor...
Let m, n, s, k be integers such that 4 ≤ s ≤ n, 4 ≤ k ≤ m and ms = nk. Let λ be a divisor of 2ms and...
AbstractA magic rectangle is an m × n array the entries of which are the first mn positive integers,...
AbstractMagic rectangles are a classical generalization of the well-known magic squares. In this pap...
AbstractWe define a (4 × n)-rectangle R with ground set G(R) = ±[c + 1, c + 2n] to be centrally symm...
A problem due to Martin Labar is to find a 3x3 magic square with 9 distinct perfect square entries o...
A magic square is an n x n array filled with n2 distinct positive integers 1, 2, ..., n2 such that t...
In this work, blocks of magic rectangles with equal and unequal sums are used to construct magic squ...
AbstractIn this paper, we collect 23 unsolved problems or conjectures on magic squares, and some upd...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
University of Minnesota M.S. thesis. June 2014. Major: Applied and Computational Mathematics. Adviso...
A magic square is a square table of numbers such that each row, column, or diagonal adds up to the s...
AbstractWe find by applying MacMahon's partition analysis that all magic squares of order three, up ...
The author worked on different kinds of magic squares. These include block-wise, bordered, block-bor...
In this work, magic squares are written with equal and unequal sums blocks of \textbf{magic rectangl...
The author worked on different kinds of magic squares. These include block-wise, bordered, block-bor...
Let m, n, s, k be integers such that 4 ≤ s ≤ n, 4 ≤ k ≤ m and ms = nk. Let λ be a divisor of 2ms and...
AbstractA magic rectangle is an m × n array the entries of which are the first mn positive integers,...
AbstractMagic rectangles are a classical generalization of the well-known magic squares. In this pap...
AbstractWe define a (4 × n)-rectangle R with ground set G(R) = ±[c + 1, c + 2n] to be centrally symm...
A problem due to Martin Labar is to find a 3x3 magic square with 9 distinct perfect square entries o...
A magic square is an n x n array filled with n2 distinct positive integers 1, 2, ..., n2 such that t...
In this work, blocks of magic rectangles with equal and unequal sums are used to construct magic squ...
AbstractIn this paper, we collect 23 unsolved problems or conjectures on magic squares, and some upd...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
University of Minnesota M.S. thesis. June 2014. Major: Applied and Computational Mathematics. Adviso...
A magic square is a square table of numbers such that each row, column, or diagonal adds up to the s...
AbstractWe find by applying MacMahon's partition analysis that all magic squares of order three, up ...
The author worked on different kinds of magic squares. These include block-wise, bordered, block-bor...
In this work, magic squares are written with equal and unequal sums blocks of \textbf{magic rectangl...
The author worked on different kinds of magic squares. These include block-wise, bordered, block-bor...
Let m, n, s, k be integers such that 4 ≤ s ≤ n, 4 ≤ k ≤ m and ms = nk. Let λ be a divisor of 2ms and...