The existence of square non-integer Heffter arrays

DOI10.26493/1855-3974.1817.b97zbMath1433.05064arXiv1808.02588OpenAlexW2602072253WikidataQ126846364 ScholiaQ126846364MaRDI QIDQ5217079

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

Publication date: 21 February 2020

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

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

zbMATH Keywords

Heffter arraysbiembedding cycle systems

Mathematics Subject Classification ID

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

Related Items

Non-zero sum Heffter arrays and their applications, Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays, Rectangular Heffter arrays: a reduction theorem, Magic partially filled arrays on abelian groups, Weak Heffter arrays and biembedding graphs on non-orientable surfaces, On the existence of integer relative Heffter arrays, A generalization of Heffter arrays, Tight globally simple nonzero sum Heffter arrays and biembeddings, Orthogonal cycle systems with cycle length less than 10, Some new results about a conjecture by Brian Alspach, Unnamed Item, A tour problem on a toroidal board, On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces, Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \), Globally simple Heffter arrays and orthogonal cyclic cycle decompositions, Relative Heffter arrays and biembeddings

Cites Work

• Square integer Heffter arrays with empty cells
• Existence of cyclic \(k\)-cycle systems of the complete graph
• Heffter arrays and biembedding graphs on surfaces
• Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph
• Biembedding Steiner Triple Systems and n-cycle Systems on Orientable Surfaces
• The existence of square integer Heffter arrays
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Tight Heffter Arrays Exist for all Possible Values
• Biembeddings of symmetric \(n\)-cycle systems
• Unnamed Item