Signed magic rectangles with two filled cells in each column

Abstract: A signed magic rectangle

S M R (m, n; r, s)

is an

m i m e s n

array with entries from

X

, where

if

m r

is odd and

X = p m 1, p m 2, l d o t s, p m m r / 2

if

m r

is even, such that precisely

r

cells in every row and

s

cells in every column are filled, every integer from set

X

appears exactly once in the array and the sum of each row and of each column is zero. In this paper we prove that a signed magic rectangle

S M R (m, n; r, 2)

exists if and only if either

m = 2

and

n = r e q u i v 0, 3 p m o d 4

or

m, r g e q 3

and

m r = 2 n

.

This page was built for publication: Signed magic rectangles with two filled cells in each column