Constructing generalized Heffter arrays via near alternating sign matrices

DOI10.1016/j.jcta.2024.105873arXiv2306.09948OpenAlexW4391990993MaRDI QIDQ6126168

Lorenzo Mella, Tommaso Traetta

Publication date: 9 April 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

biembeddingsorthogonal decompositionsgeneralized Heffter arraysnear alternating sign matricessimple sequences

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Square integer Heffter arrays with empty cells
• On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
• Non-zero sum Heffter arrays and their applications
• Heffter arrays and biembedding graphs on surfaces
• The existence of square integer Heffter arrays
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• A Generalization of Alternating Sign Matrices
• Tight Heffter Arrays Exist for all Possible Values
• A generalization of Heffter arrays
• Cyclic cycle systems of the complete multipartite graph
• Tight globally simple nonzero sum Heffter arrays and biembeddings

This page was built for publication: Constructing generalized Heffter arrays via near alternating sign matrices