Signed magic rectangles with three filled cells in each column

zbMATH Open1461.05019arXiv1912.08536MaRDI QIDQ3387178FDOQ3387178

Authors: David Leach, Brandi Ellis, Abdollah Khodkar 

Publication date: 12 January 2021

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$.

Full work available at URL: https://arxiv.org/abs/1912.08536

Recommendations

• Existence of some signed magic arrays
• Magic rectangles with empty cells
• Magic rectangles, signed magic arrays and integer \(\lambda\)-fold relative Heffter arrays
• Magic rectangle sets of odd order
• Magic rectangles revisited

zbMATH Keywords

Heffter arraymagic arraysigned magic array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cited In (7)

• Magic rectangles with empty cells
• A survey of Heffter arrays
• Rectangular Heffter arrays: a reduction theorem
• Magic rectangles, signed magic arrays and integer \(\lambda\)-fold relative Heffter arrays
• On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
• Magic partially filled arrays on abelian groups
• Existence of some signed magic arrays

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)