Tight Heffter arrays exist for all possible values

DOI10.1002/JCD.21520MaRDI QIDQ5347396zbMATH OpenOpenAlexFDO

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

Publication date 23 May 2017

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

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

zbMATH Keywords

biembeddingHeffter arraysSkolem sequencesSteiner triple systems

Mathematics Subject Classification ID

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

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.

Recommendations

• On the existence of integer relative Heffter arrays
• The existence of square integer Heffter arrays
• The existence of square non-integer Heffter arrays
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Square integer Heffter arrays with empty cells

Cites work

• Heffter arrays and biembedding graphs on surfaces
• On partial sums in cyclic groups
• Square integer Heffter arrays with empty cells

Cited in

(29)

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

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)