Completing the Existence Problem for Integer Relative Heffter Arrays Hk(n;k)
Lorenzo Mella
Abstract
Heffter arrays, introduced by Archdeacon in 2015, are combinatorial structures with applications to cyclic cycle systems and biembeddings of graphs on surfaces. Costa, Morini, Pasotti and Pellegrini proposed in 2020 the notion of relative Heffter arrays as a generalization of classical Heffter arrays, inspired by the concept of relative difference families. In their work, the existence problem of integer relative Heffter arrays Hk(n;k) was solved for all k≠ 5, while the case k=5 and n 0 4 remained open, apart from two sporadic examples with n=8,16. In this article, we consider this open problem and we construct an H5(n;5) for every n 0 4, n≥ 12. As a consequence, the existence problem of integer relative Hk(n;k) is completely settled.
Create a lesson
Related papers
A Polytopal Realization of Higher-Categorical Associahedra
Spencer Backman, Nathaniel Bottman, Daria Poliakova
An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure
Štefan Gyürki
Maximizing the number of cliques in Kr+1-free graphs with forbidden properties
Aleyah Dawkins, Rachel Kirsch
On Smooth Combinatorial Products of Simplices
Juliana Curtis, Tuong Le, Chayim Lowen
Characterization of tree-child networks in terms of mu vectors
Toni Fuentes, Vincent Moulton, Katharina T. Huber et al.
Extremal subtrees of critical beta-splitting trees
Anna Brandenberger, Byron Chin, Elchanan Mossel