Paper detail

Minimal simplicial spherical mappings with a given degree

This paper studies the minimal number of vertices $λ(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 $λ(n,d)$ in dimensions $n \geq 3$. Furthermore, we provide exact formulas for small values of $d$, showing that $λ(n,d)=n+d+3$ for $n \geq 3$ and $d=2,3,4$. A key technical result is the identity $λ(n,d) = λ(d-1,d) + n - d + 1$ for $n \geq d$, which allows us to reduce higher-dimensional cases to lower-dimensional ones. The proofs involve constructive methods based on local modifications of triangulations and combinatorial arguments.