Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Magic partially filled arrays on abelian groups (2209.10246v1)

Published 21 Sep 2022 in math.CO

Abstract: In this paper we introduce a special class of partially filled arrays. A magic partially filled array $\mathrm{MPF}\Omega(m,n; s,k)$ on a subset $\Omega$ of an abelian group $(\Gamma,+)$ is a partially filled array of size $m\times n$ with entries in $\Omega$ such that $(i)$ every $\omega \in \Omega$ 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\in \Gamma$ 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\Gamma$, we have a zero-sum magic partially filled array ${}0\mathrm{MPF}_\Omega(m,n; s,k)$. Examples of these objects are magic rectangles, $\Gamma$-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 $\mathrm{MPF}_\Omega(m,n;s,k)$ where $\Omega={1,2,\ldots,nk}\subset\mathbb{Z}$. We also construct zero-sum magic partially filled arrays when $\Omega$ is the abelian group $\Gamma$ or the set of its nonzero elements.

Summary

We haven't generated a summary for this paper yet.