English

Relative Heffter arrays and biembeddings

Combinatorics 2020-03-04 v2

Abstract

Relative Heffter arrays, denoted by Ht(m,n;s,k)\mathrm{H}_t(m,n; s,k), have been introduced as a generalization of the classical concept of Heffter array. A Ht(m,n;s,k)\mathrm{H}_t(m,n; s,k) is an m×nm\times n partially filled array with elements in Zv\mathbb{Z}_v, where v=2nk+tv=2nk+t, whose rows contain ss filled cells and whose columns contain kk filled cells, such that the elements in every row and column sum to zero and, for every xZvx\in \mathbb{Z}_v not belonging to the subgroup of order tt, either xx or x-x 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 K2nk+tt×tK_{\frac{2nk+t}{t}\times t} into an orientable surface. In particular, we construct such biembeddings providing integer globally simple square relative Heffter arrays for t=k=3,5,7,9t=k=3,5,7,9 and n3(mod4)n\equiv 3 \pmod 4 and for k=3k=3 with t=n,2nt=n,2n, any odd nn.

Keywords

Cite

@article{arxiv.1909.03064,
  title  = {Relative Heffter arrays and biembeddings},
  author = {Simone Costa and Anita Pasotti and Marco Antonio Pellegrini},
  journal= {arXiv preprint arXiv:1909.03064},
  year   = {2020}
}

Comments

arXiv admin note: text overlap with arXiv:1906.03932

R2 v1 2026-06-23T11:08:07.675Z