Related papers: Heffter Arrays and Biembedding Graphs on Surfaces
A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and…
In this paper we introduce a new class of partially filled arrays that, as Heffter arrays, are related to difference families, graph decompositions and biembeddings. A non-zero sum Heffter array $\mathrm{N}\mathrm{H}(m,n; h,k)$ is an $m…
Relative Heffter arrays, denoted by $\mathrm{H}_t(m,n; s,k)$, have been introduced as a generalization of the classical concept of Heffter array. A $\mathrm{H}_t(m,n; s,k)$ is an $m\times n$ partially filled array with elements in…
In 2015, Archdeacon introduced the notion of Heffter arrays and showed the connection between Heffter arrays and biembedding m-cycle and an n-cycle systems on a surface. In this paper we exploit this connection and prove that for every n >=…
Square relative non-zero sum Heffter arrays, denoted by $\mathrm{N}\mathrm{H}_t(n;k)$, have been introduced as a variant of the classical concept of Heffter array. An $\mathrm{N}\mathrm{H}_t(n; k)$ is an $n\times n$ partially filled array…
Square Heffter arrays are $n\times n$ arrays such that each row and each column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…
A Heffter array $H(n;k)$ is an $n\times n$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…
In this paper we will show the existence of a face $2$-colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length $k$, for infinitely many values of $k$. In particular, under certain…
Heffter arrays are combinatorial structures used to construct orthogonal cyclic cycle decompositions and biembeddings of complete graphs onto surfaces. A Heffter array $H(m,n;h,k)$ is an $m \times n$ partially filled array with distinct…
Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well…
Archdeacon, in his seminal paper $[1]$, defined the concept of Heffter array in order to provide explicit constructions of $\mathbb{Z}_{v}$-regular biembeddings of complete graphs $K_v$ into orientable surfaces. In this paper, we first…
In this paper we define a new class of partially filled arrays, called $\lambda$-fold relative Heffter arrays, that are a generalisation of the Heffter arrays introduced by Archdeacon in 2015. After showing the connection of this new…
A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$.…
This article aims to provide exponential lower bounds on the number of non-isomorphic $k$-gonal biembeddings of the complete multipartite graph into orientable surfaces. For this purpose, we use the concept, introduced by Archdeacon in…
In this paper we define a new class of partially filled arrays, called relative Heffter arrays, that are a generalization of the Heffter arrays introduced by Archdeacon in 2015. Let $v=2nk+t$ be a positive integer, where $t$ divides $2nk$,…
In this paper we introduce a particular class of Heffter arrays, called globally simple Heffter arrays, whose existence gives at once orthogonal cyclic cycle decompositions of the complete graph and of the cocktail party graph. In…
A square integer relative Heffter array is an $n \times n$ array whose rows and columns sum to zero, each row and each column has exactly $k$ entries and either $x$ or $-x$ appears in the array for every $x \in \mathbb{Z}_{2nk+t}\setminus…
In [12] was introduced, for cyclic groups, the class of partially filled arrays of the non-zero sum Heffter array that are, as the Heffter arrays, related to difference families, graph decompositions, and biembeddings. Here we generalize…
Archdeacon, in his seminal paper $[1]$, defined the concept of Heffter array to provide explicit constructions of biembeddings of the complete graph $K_v$ into orientable surfaces, the so-called Archdeacon embeddings, and proved that these…
Let $S$ be a subset of a group $G$ (not necessarily abelian) such that $S\,\cap -S$ is empty or contains only elements of order $2$, and let $\mathbf{h}=(h_1,\ldots, h_m)\in \mathbb{N}^m$ and $\mathbf{k}=(k_1, \ldots, k_n)\in \mathbb{N}^n$.…