Magic partially filled arrays on abelian groups

Abstract

In this paper we introduce a special class of partially filled arrays. A magic partially filled array MPF(m,n; s,k) on a subset of an abelian group (,+) is a partially filled array of size m× n with entries in such that (i) every ω ∈ appears once in the array; (ii) each row contains s filled cells and each column contains k filled cells; (iii) there exist (not necessarily distinct) elements x,y∈ such that the sum of the elements in each row is x and the sum of the elements in each column is y. In particular, if x=y=0, we have a zero-sum magic partially filled array 0MPF(m,n; s,k). Examples of these objects are magic rectangles, -magic rectangles, signed magic arrays, (integer or non integer) Heffter arrays. Here, we give necessary and sufficient conditions for the existence of a magic rectangle with empty cells, i.e., of an MPF(m,n;s,k) where =\1,2,…,nk\⊂Z. We also construct zero-sum magic partially filled arrays when is the abelian group or the set of its nonzero elements.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…