Tight Heffter Arrays Exist for all Possible Values

DOI10.1002/JCD.21520zbMATH Open1362.05029arXiv1509.00430OpenAlexW2358490219MaRDI QIDQ5347396FDOQ5347396

J. H. Dinitz, Dan S. Archdeacon, Tomas Boothby

Publication date: 23 May 2017

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Abstract: A tight Heffter array H(m,n) is an m x n matrix with nonzero entries from Z_{2mn+1} such that i) the sum of the elements in each row and each column is 0, and ii) no element from {x,-x appears twice. We prove that H(m,n) exist if and only if both m and n are at least 3. If all entries are integers of magnitude at most mn satisfying every row and column sum is 0 over the integers and also satisfying ii) we call H an integer Heffter array. We show integer Heffter arrays exist if and only if mn equiv 0,3 (mod 4). Finally, an integer Heffter array is shiftable if each row and column contains an the same number of positive and negative integers. We show that shiftable integer arrays exists exactly when both $m,n$ are even. This research report contains all of the details of the proofs. It is meant to accompany the journal version of this paper.

Full work available at URL: https://arxiv.org/abs/1509.00430

zbMATH Keywords

Steiner triple systemsSkolem sequencesbiembeddingHeffter arrays

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Triple systems (05B07)

Cites Work

• Heffter arrays and biembedding graphs on surfaces
• Square integer Heffter arrays with empty cells
• On Partial Sums in Cyclic Groups

Cited In (23)

• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Relative Heffter arrays and biembeddings
• Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays
• A tour problem on a toroidal board
• The existence of square non-integer Heffter arrays
• Heffter arrays and biembedding graphs on surfaces
• A survey of Heffter arrays
• Tight Heffter arrays from finite fields
• A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays
• A generalization of Heffter arrays
• Non-zero sum Heffter arrays and their applications
• Conservative trees
• A problem on partial sums in abelian groups
• Orthogonal cycle systems with cycle length less than 10
• Rectangular Heffter arrays: a reduction theorem
• On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
• On the existence of integer relative Heffter arrays
• Magic partially filled arrays on abelian groups
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Existence of some signed magic arrays
• Weak Heffter arrays and biembedding graphs on non-orientable surfaces
• Square integer Heffter arrays with empty cells
• Constructing generalized Heffter arrays via near alternating sign matrices

This page was built for publication: Tight Heffter Arrays Exist for all Possible Values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347396)