Search arXivSearch

arXiv · 2505.02386

Minimal Simplicial Degree $d$ Maps from Genus $g$ Surfaces to the Torus

Abstract

The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied, particularly in the context of simplicial maps between orientable triangulable spaces. In 1982, Gromov proved that if degree $d$ maps exist from a genus $g$ orientable surface to a genus $h$ orientable surface for every $d \in \mathbb{Z}$, then $h$ must be 0 or 1. Recently, degree $d$ self-maps on spheres, particularly on genus 0 surfaces, have been investigated. In this paper, we focus on the unique minimal 7-vertex triangulation of the torus. We construct simplicial degree $d$ maps from a triangulation of a genus $g$ surface to the 7-vertex triangulation of the torus for $g \geq 1$. Our construction of degree $d$ maps is minimal for every $d$ when $g = 1,2$. If $g \geq 3$, then our construction remains minimal for $|d| \geq 2g - 1$. We believe that this concept will be highly useful in combinatorial topology, as it leads to several intriguing open research problems. In the final section, we propose some of these open research problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Biplab Basak, Ayushi Trivedi. 2026-01-06. Minimal Simplicial Degree $d$ Maps from Genus $g$ Surfaces to the Torus. https://arxiv.org/abs/2505.02386

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO