Constructing generalized Heffter arrays via near alternating sign matrices

Let S be a subset of a group G (not necessarily abelian) such that S∩−S is empty or contains only elements of order 2, and let h=(h1,…,hm)∈Nm and k=(k1,…,kn)∈Nn. A generalized Heffter array GHASλ(m,n;h,k) over G is an m×n matrix A=(aij) such that: the i-th row (resp. j-th column) of A contains exactly hi (resp. kj) nonzero elements, and the list {aij,−aij|aij≠0} equals λ times the set S∪−S. We speak of a zero sum (resp. nonzero sum) GHA if each row and each column of A sums to zero (resp. a nonzero element), with respect to some ordering. In this paper, we use near alternating sign matrices to build both zero and nonzero sum GHAs, over cyclic groups, having the further strong property of being simple. In particular, we construct zero sum and simple GHAs whose row and column weights are congruent to 0 modulo 4. This result also provides the first infinite family of simple (classic) Heffter arrays to be rectangular (m≠n) and with less than n nonzero entries in each row. Furthermore, we build nonzero sum GHASλ(m,n;h,k) over an arbitrary group G whenever S contains enough noninvolutions, thus extending previous nonconstructive results where ±S=G∖H for some subgroup H of G. Finally, we describe how GHAs can be used to build orthogonal decompositions and biembeddings of Cayley graphs (over groups not necessarily abelian) onto orientable surfaces.