Search arXiv⌕ Search

arXiv · 2111.13085

Semi-equivelar toroidal maps and their k-edge covers

Abstract

If the face\mbox{-}cycles at all the vertices in a map are of same type then the map is called semi\mbox{-}equivelar. A tiling is edge-homogeneous if any two edges with vertices of congruent face-cycles. In general, edge-homogeneous maps on a surface form a bigger class than edge-transitive maps. There are edge-homogeneous toroidal maps which are not edge\mbox{-}transitive. An edge-homogeneous map is called $k$-edge-homogeneous if it contains $k$ number of edge orbits. In particular, if $k=1$ then it is called edge-transitive map. In general, a map is called $k$-edge orbital or $k$-orbital if it contains $k$ number of edge orbits. A map is called minimal if the number of edges is minimal. A surjective mapping $η\colon M \to K$ from a map $M$ to a map $K$ is called a covering if it preserves adjacency and sends vertices, edges, faces of $M$ to vertices, edges, faces of $K$ respectively. Orbani{\' c} et al. and {\v S}ir{á}{\v n} et al. have shown that every edge-homogeneous toroidal map has edge-transitive cover. In this article, we show the bounds of edge orbits of edge-homogeneous toroidal maps. Using these bounds, we show the bounds of edge orbits of non-edge-homogeneous semi-equivelar toroidal maps. We also prove that if a edge-homogeneous map is $k$ edge orbital then it has a finite index $m$-edge orbital minimal cover for $m \le k$. We also show the existence and classification of $n$ sheeted covers of edge-homogeneous toroidal maps for each $n \in \mathbb{N}$. We extend this to non-edge-homogeneous semi-equivelar toroidal maps and prove the same results, i.e., if a non-edge-homogeneous map is $k$ edge orbital then it has a finite index $m$-edge orbital minimal cover (non-edge-homogeneous) for $m \le k$ and then classify them for each sheet.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arnab Kundu, Dipendu Maity. 2021-12-20. Semi-equivelar toroidal maps and their k-edge covers. https://doi.org/10.1515/forum-2023-0168

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗