Signed magic rectangles with two filled cells in each column
type: Item
instance of: scholarly article
title: Signed magic rectangles with two filled cells in each column
zbMATH Open document ID: 1545.05089
DOI: 10.61091/jcmcc121-03
author: Abdollah Khodkar
author: Brandi Ellis
published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
publication date: 2024-08-13T00:00:00Z
review text: It is known that a magic rectangle of order \(m\times n\) \(\mathrm{MR}(m, n)\) is an arrangement of the numbers from 0 to \(mn - 1\) in an \(m\times n\) rectangle such that each number occurs exactly once in the rectangle and the sum of the entries of each row is the same and the sum of entries of each column is also the same. The authors of this paper define a signed magic rectangle \(\mathrm{SMR}(m, n; r, s)\) as an $m\times n$ array with entries from \(X\), where \(X=\{0,\pm 1, \pm 2, \dots, \pm (ms- 1)/2\}\) if \(mr\) is odd and \(X=\{\pm 1, \pm 2, \dots,\pm mr/2\}\) if \(mr\) 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. They also show that a signed magic rectangle \(\mathrm{SMR}(m, n; r, 2)\) exists if and only if \(m = 2\) and \(n = r\equiv 0, 3 \pmod 4\) or \(m, r\geq 3\) and \(mr = 2n\). They first prove a sequence of seventeen lemmas to show their main result.
reviewed by: V. Yegnanarayanan
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 7896121
zbMATH Keywords: signed magic rectangle
MaRDI profile type: MaRDI publication profile
cites work: On magic squares and similar number figures
cites work: On magic rectangles with odd sides.
cites work: Existence of magic rectangles
cites work: Q5071569
cites work: Existence of some signed magic arrays
description: scientific article; zbMATH DE number 7896121