Signed magic arrays: existence and constructions
Fiorenza Morini, Marco Antonio Pellegrini

TL;DR
This paper investigates the existence and construction of signed magic arrays, providing necessary and sufficient conditions for their existence when certain parameters are even or odd coprime, expanding the understanding of these combinatorial structures.
Contribution
The paper introduces new constructions for signed magic arrays when n is even and s,k are odd coprime, establishing comprehensive existence conditions.
Findings
Constructed signed magic arrays for even n and odd coprime s,k
Established necessary and sufficient conditions for all admissible parameters
Extended the theory of combinatorial array designs
Abstract
Let be four integers such that , and . A signed magic array is an partially filled array whose entries belong to the subset , where if is odd and if is even, satisfying the following requirements: every appears once in the array; each row contains exactly filled cells and each column contains exactly filled cells; the sum of the elements in each row and in each column is . In this paper we construct these arrays when is even and are odd coprime integers. This allows us to give necessary and sufficient conditions for the existence of an for all admissible values of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArchitecture and Computational Design
