A generalization of Heffter arrays
From MaRDI portal
Publication:6185558
DOI10.1002/jcd.21684arXiv1906.03932OpenAlexW2990939222WikidataQ126805976 ScholiaQ126805976MaRDI QIDQ6185558
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
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30)
Related Items (3)
Weak Heffter arrays and biembedding graphs on non-orientable surfaces ⋮ Constructing generalized Heffter arrays via near alternating sign matrices ⋮ Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Square integer Heffter arrays with empty cells
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- A problem on partial sums in abelian groups
- Cyclic uniform 2-factorizations of the complete multipartite graph
- Orthogonal decomposition and packing of complete graphs
- 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
- On Partial Sums in Cyclic Groups
- 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
- Relative Heffter arrays and biembeddings
- On strongly sequenceable abelian groups
- The existence of square non-integer Heffter arrays
- Distinct partial sums in cyclic groups: polynomial method and constructive approaches
- Tight Heffter Arrays Exist for all Possible Values
- Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts
This page was built for publication: A generalization of Heffter arrays
