arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.08536math.CO
收藏

每列有三个填充单元格的带符号魔术矩形

Signed magic rectangles with three filled cells in each column

Abdollah Khodkar, David Leach, Brandi Ellis

摘要:

{ \em符号魔术矩形} $SMR(m,n;k, s)$是具有来自$X$的条目的$m \times n$阵列,其中如果$mk$是奇数则为$X=\{0,\pm1,\pm2,\ldots, $ $\pm (mk-1)/2\}$,如果$mk$是偶数则为$X = \{\pm1,\pm2,\ldots,\pm mk/2\}$,使得精确地填充每行中的$k$单元和每列中的$s$单元,来自集合$X$的每个整数在阵列中精确地出现一次,并且每行和每列的总和为零。本文证明了符号幻矩形$SMR(m,n;k, 3)$存在的充要条件是$3\leq m,k\leq n$和$mk=3n$。

英文摘要:

A {\em signed magic rectangle} $SMR(m,n;k, s)$ is an $m \times n$ array with entries from $X$, where $X=\{0,\pm1,\pm2,\ldots, $ $\pm (mk-1)/2\}$ if $mk$ is odd and $X = \{\pm1,\pm2,\ldots,\pm mk/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 $3\leq m,k\leq n$ and $mk=3n$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑