The existence of square non-integer Heffter arrays

DOI10.26493/1855-3974.1817.B97zbMATH Open1433.05064OpenAlexW2602072253WikidataQ126846364 ScholiaQ126846364MaRDI QIDQ5217079FDOQ5217079

Authors: Nicholas J. Cavenagh, Jeffery H. Dinitz, Diane Donovan, Emine Şule Yazıcı 

Publication date: 21 February 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: A Heffter array $H(n;k)$ is an $nimesn$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1leqxleqnk$. Heffter arrays are useful for embedding the graph $K_{2nk+1}$ on an orientable surface. An integer Heffter array is one in which each row and column sum is $0$. Necessary and sufficient conditions (on $n$ and $k$) for the existence of an integer Heffter array $H(n;k)$ were verified by Archdeacon, Dinitz, Donovan and Yazi ci (2015) and Dinitz and Wanless (2017). In this paper we consider square Heffter arrays that are not necessarily integer. We show that such Heffter arrays exist whenever $3leqk<n$.

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

Recommendations

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

zbMATH Keywords

Heffter arraysbiembedding cycle systems

Mathematics Subject Classification ID

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

Cites Work

• Existence of cyclic \(k\)-cycle systems of the complete graph
• Biembeddings of symmetric \(n\)-cycle systems
• Design and topology
• Biembedding Steiner triple systems and \(n\)-cycle systems on orientable surfaces
• Heffter arrays and biembedding graphs on surfaces
• The existence of square integer Heffter arrays
• Tight Heffter arrays exist for all possible values
• Square integer Heffter arrays with empty cells
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Biembedding a Steiner triple system with a Hamilton cycle decomposition of a complete graph

Cited In (22)

• Tight globally simple nonzero sum Heffter arrays and biembeddings
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Relative Heffter arrays and biembeddings
• Tight Heffter arrays exist for all possible values
• A tour problem on a toroidal board
• A survey of Heffter arrays
• Heffter spaces
• A generalization of Heffter arrays
• Non-zero sum Heffter arrays and their applications
• On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
• Some new results about a conjecture by Brian Alspach
• Orthogonal cycle systems with cycle length less than 10
• Rectangular Heffter arrays: a reduction theorem
• Magic rectangles, signed magic arrays and integer \(\lambda\)-fold relative Heffter arrays
• 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 \)
• The existence of square integer Heffter arrays
• Existence of \(\lambda\)-fold non-zero sum Heffter arrays through local considerations
• Weak Heffter arrays and biembedding graphs on non-orientable surfaces
• Square integer Heffter arrays with empty cells

This page was built for publication: The existence of square non-integer Heffter arrays

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