Signed magic arrays: existence and constructions

Abstract

Let m,n,s,k be four integers such that 1≤slant s ≤slant n, 1≤slant k≤slant m and ms=nk. A signed magic array SMA(m,n; s,k) is an m× n partially filled array whose entries belong to the subset Ω⊂ Z, where Ω=\0, 1, 2,…, (nk-1)/2\ if nk is odd and Ω=\ 1, 2, …, nk/2\ if nk is even, satisfying the following requirements: (a) every ω∈ Ω appears once in the array; (b) each row contains exactly s filled cells and each column contains exactly k filled cells; (c) the sum of the elements in each row and in each column is 0. In this paper we construct these arrays when n is even and s,k≥slant 5 are odd coprime integers. This allows us to give necessary and sufficient conditions for the existence of an SMA(m,n; s,k) for all admissible values of m,n,s,k.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…