Signed magic rectangles with three filled cells in each column

From MaRDI portal
Publication:3387178




Abstract: A {em signed magic rectangle} SMR(m,n;k,s) is an mimesn array with entries from X, where if mk is odd and X=pm1,pm2,ldots,pmmk/2 if mk is even, such that precisely k 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 SMR(m,n;k,3) exists if and only if 3leqm,kleqn and mk=3n.









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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387178)