Relative Heffter arrays and biembeddings
Simone Costa, Anita Pasotti, Marco Antonio Pellegrini

TL;DR
This paper introduces relative Heffter arrays as a generalization of classical Heffter arrays and demonstrates their use in constructing biembeddings of cyclic cycle decompositions of complete multipartite graphs into orientable surfaces.
Contribution
The paper develops new constructions of biembeddings using relative Heffter arrays, expanding the applications of these arrays in topological graph theory.
Findings
Constructed biembeddings for specific parameters $t=k=3,5,7,9$ and $n\equiv 3 \pmod 4$.
Provided integer globally simple square relative Heffter arrays for certain parameters.
Extended the use of relative Heffter arrays to embed cyclic decompositions into surfaces.
Abstract
Relative Heffter arrays, denoted by , have been introduced as a generalization of the classical concept of Heffter array. A is an partially filled array with elements in , where , whose rows contain filled cells and whose columns contain filled cells, such that the elements in every row and column sum to zero and, for every not belonging to the subgroup of order , either or appears in the array. In this paper we show how relative Heffter arrays can be used to construct biembeddings of cyclic cycle decompositions of the complete multipartite graph into an orientable surface. In particular, we construct such biembeddings providing integer globally simple square relative Heffter arrays for and and for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
