Metraipolis › archive › dc_9ab072ef7a49

Completing the Existence Problem for Integer Relative Heffter Arrays $\mathrm{H}_k(n;k)$ — arXiv:2609.24399

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24399
License (as archived)
CC0-1.0
Archived
2026-10-09T21:49:47.442Z
SHA-256 of the archived text
4e089de9d0bc91e51f4c4c0618b5e3135bdff9907237b159eb08f0858d69abbf
Stable URL of this page
https://metraipolis.com/documento/dc_9ab072ef7a49

How to cite

Completing the Existence Problem for Integer Relative Heffter Arrays $\mathrm{H}_k(n;k)$ — arXiv:2609.24399 — arXiv (en), https://arxiv.org/abs/2609.24399 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9ab072ef7a49 (Metraipolis archive dc_9ab072ef7a49, sha256 4e089de9d0bc91e51f4c4c0618b5e3135bdff9907237b159eb08f0858d69abbf)
BibTeX
@misc{dc9ab072ef7a49,
  title = {Completing the Existence Problem for Integer Relative Heffter Arrays $mathrmH_k(n;k)$ — arXiv:2609.24399},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24399},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9ab072ef7a49; sha256 4e089de9d0bc91e51f4c4c0618b5e3135bdff9907237b159eb08f0858d69abbf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24399. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\mathrm{H}_k(n;k)$ was solved for all $k\neq 5$, while the case $k=5$ and $n \equiv 0 \pmod{4}$ remained open, apart from two sporadic examples with $n=8,16$. In this article, we consider this open problem and we construct an $\mathrm{H}_5(n;5)$ for every $n\equiv 0 \pmod{4}$, $n\geq 12$. As a consequence, the existence problem of integer relative $\mathrm{H}_k(n;k)$ is completely settled.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.24399 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:26:41.152Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).