Square integer Heffter arrays with empty cells
From MaRDI portal
Abstract: A Heffter array is an matrix with nonzero entries from such that each row contains filled cells and each column contains filled cells, every row and column sum to 0, and no element from appears twice. Heffter arrays are useful in embedding the complete graph on an orientable surface where the embedding has the property that each edge borders exactly one cycle and one cycle. Archdeacon, Boothby and Dinitz proved that these arrays can be constructed in the case when , i.e. every cell is filled. In this paper we concentrate on square arrays with empty cells where every row sum and every column sum is in . We solve most of the instances of this case.
Recommendations
Cites work
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3332246 (Why is no real title available?)
- Cyclic biembeddings of twofold triple systems
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Design and topology
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Further biembeddings of twofold triple systems
- Heffter arrays and biembedding graphs on surfaces
- On partial sums in cyclic groups
- The CRC handbook of combinatorial designs
- The topological theory of current graphs
- Tight Heffter arrays exist for all possible values
- Triples, current graphs and biembeddings
Cited in
(29)- A tour problem on a toroidal board
- Non-zero sum Heffter arrays and their applications
- The existence of square integer Heffter arrays
- Magic rectangles, signed magic arrays and integer \(\lambda\)-fold relative Heffter arrays
- Existence of \(\lambda\)-fold non-zero sum Heffter arrays through local considerations
- Relative Heffter arrays and biembeddings
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
- On the existence of integer relative Heffter arrays
- Rectangular Heffter arrays: a reduction theorem
- Weak Heffter arrays and biembedding graphs on non-orientable surfaces
- Tight globally simple nonzero sum Heffter arrays and biembeddings
- A generalization of Heffter arrays
- Mutually orthogonal cycle systems
- Conservative trees
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays
- Heffter spaces
- Heffter arrays and biembedding graphs on surfaces
- Some new results about a conjecture by Brian Alspach
- A class of highly symmetric Archdeacon embeddings
- The existence of square non-integer Heffter arrays
- A problem on partial sums in abelian groups
- Constructing generalized Heffter arrays via near alternating sign matrices
- A survey of Heffter arrays
- Existence of some signed magic arrays
- Tight Heffter arrays exist for all possible values
- Orthogonal cycle systems with cycle length less than 10
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
This page was built for publication: Square integer Heffter arrays with empty cells
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887425)