相关论文: Minimal Simplicial Degree $d$ Maps from Genus $g$ …
The degree of a map between orientable manifolds is a fundamental concept in topology that aids in understanding the structure and properties of the manifolds and the maps between them. Numerous studies have been conducted on the degree of…
The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…
This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…
The mapping class group of an orientable surface, which records its symmetries up to isotopy, plays a central role in low-dimensional topology. This chapter explores the foundational problem of determining minimal generating sets for these…
This chapter provides a comprehensive survey of foundational results and recent advances concerning minimal generating sets for the mapping class group of a nonorientable surface, $\mathrm{Mod}(N_{g})$, and its index-two twist subgroup,…
We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
Let $N_{g,n}$ be a genus $g$ compact non-orientable surface with $n$ boundaries. We explain about relations on the level $d$ mapping class group $\mathcal{M}_d(N_{g,0})$ of $N_{g,0}$ and the level $d$ principal congruence subgroup…
We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…
We sharpen an estimate of Bourgain, Brezis, and Nguyen for the topological degree of continuous maps from a sphere $\mathbb{S}^d$ into itself in the case $d \ge 2$. This provides the answer for $d \ge 2$ to a question raised by Brezis. The…
A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.
Extending work of Kapouleas and Yang, for any integers $N \geq 2$, $k, \ell \geq 1$, and $m$ sufficiently large, we apply gluing methods to construct in the round $3$-sphere a closed embedded minimal surface that has genus $k\ell…
For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…
In this paper, we study trigonal minimal surfaces in flat tori. First, we show a topological obstruction similar to that of hyperelliptic minimal surfaces. Actually, the genus of trigonal minimal surface in 3-dimensional flat torus must be…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
Consider a surface $S$ and let $M\subset S$. If $S\setminus M$ is not connected, then we say $M$ \emph{separates} $S$, and we refer to $M$ as a \emph{separating set} of $S$. If $M$ separates $S$, and no proper subset of $M$ separates $S$,…
We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…
We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…