A generalization of Heffter arrays

DOI10.1002/JCD.21684MaRDI QIDQ6185558zbMATH OpenOpenAlexWikidataFDO

Authors Simone Costa, Fiorenza Morini, Anita Pasotti, Marco Antonio Pellegrini

Publication date 29 January 2024

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

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

zbMATH Keywords

Heffter arraymultipartite complete graphorthogonal cyclic cycle decomposition

Mathematics Subject Classification ID

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

Abstract: In this paper we define a new class of partially filled arrays, called relative Heffter arrays, that are a generalization of the Heffter arrays introduced by Archdeacon in 2015. Let $v=2nk+t$ be a positive integer, where $t$ divides $2nk$, and let $J$ be the subgroup of $mathbb{Z}_v$ of order $t$. A $H_t(m,n;s,k)$ Heffter array over $mathbb{Z}_v$ relative to $J$ is an $mimesn$ partially filled array with elements in $mathbb{Z}_v$ such that: (a) each row contains $s$ filled cells and each column contains $k$ filled cells; (b) for every $xinmathbb{Z}_{v}setminusJ$, either $x$ or $-x$ appears in the array; (c) the elements in every row and column sum to $0$. Here we study the existence of square integer (i.e. with entries chosen in $pmleft1,dots,leftlfloorfrac2nk+t2ightflooright$ and where the sums are zero in $mathbbZ$) relative Heffter arrays for $t=k$, denoted by $H_k(n;k)$. In particular, we prove that for $3leqkleqn$, with $keq5$, there exists an integer $H_k(n;k)$ if and only if one of the following holds: (a) $k$ is odd and $nequiv0,3pmod4$; (b) $kequiv2pmod4$ and $n$ is even; (c) $kequiv0pmod4$. Also, we show how these arrays give rise to cyclic cycle decompositions of the complete multipartite graph.

Recommendations

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

Cites work

• A problem on partial sums in abelian groups
• Biembedding Steiner triple systems and n-cycle systems on orientable surfaces
• Combinatorial designs and the theorem of Weil on multiplicative character sums
• Cycle decompositions with a sharply vertex transitive automorphism group
• Cyclic and symmetric Hamiltonian cycle systems of the complete multipartite graph: even number of parts
• Cyclic uniform 2-factorizations of the complete multipartite graph
• Distinct partial sums in cyclic groups: polynomial method and constructive approaches
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Heffter arrays and biembedding graphs on surfaces
• scientific article; zbMATH DE number 1229693 (Why is no real title available?)
• scientific article; zbMATH DE number 5038480 (Why is no real title available?)
• On partial sums in cyclic groups
• On strongly sequenceable abelian groups
• On the existence of integer relative Heffter arrays
• Orthogonal decomposition and packing of complete graphs
• Relative Heffter arrays and biembeddings
• Sequences in dihedral groups with distinct partial products
• Square integer Heffter arrays with empty cells
• The existence of square integer Heffter arrays
• The existence of square non-integer Heffter arrays
• Tight Heffter arrays exist for all possible values

Cited in

(7)

• Mutually orthogonal cycle systems
• Weak Heffter arrays and biembedding graphs on non-orientable surfaces
• Constructing generalized Heffter arrays via near alternating sign matrices
• Tight globally simple nonzero sum Heffter arrays and biembeddings
• A survey of Heffter arrays
• On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
• Biembeddings of Archdeacon type: their full automorphism group and their number

This page was built for publication: A generalization of Heffter arrays

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