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.

💡 Research Summary

The paper investigates the minimal number of vertices, denoted λ(n,d), required for a triangulation of the n‑sphere Sⁿ to admit a simplicial map of prescribed degree d into the boundary of an (n+1)‑simplex (identified with the standard (n+2)‑vertex sphere Sⁿⁿ⁺²). After recalling basic facts—λ(1,d)=3d, λ(2,d)=2|d|+2 for |d|≥3, and λ(n,1)=n+2—the authors focus on dimensions n≥3.

The first technical ingredient is Lemma 1, which shows that raising the dimension by one adds at most one vertex while preserving the degree: λ(n+1,d) ≤ λ(n,d)+1. The construction is a join of the original triangulation with a new vertex carrying a fresh colour. Lemma 2 provides a converse bound when the total number of vertices is small: if λ(n,d) ≤ 2n+3 then λ(n,d) ≥ λ(n−1,d)+1. This follows from a pigeon‑hole argument that guarantees a vertex of the target simplex has a unique pre‑image, allowing a dimension‑reduction step that does not change the degree.

Combining these lemmas yields Lemma 3, establishing a general lower bound for n ≥ d−1: λ(n,d) ≥ λ(d−1,d) + n − d + 1. In other words, once the minimal vertex count for the “critical” dimension d−1 is known, any higher dimension cannot require fewer than that baseline plus the excess dimensions.

The authors then present three main theorems.

Theorem 1 gives a universal upper bound
 λ(n,d) ≤ n + 2 n d + (2 n + 2).
The proof writes d = k n + ℓ with 0 ≤ ℓ < n, constructs a base triangulation with n+3+ℓ vertices and degree ℓ, and then repeats a local subdivision step k times. Each step replaces a positively oriented n‑simplex by n+1 positively oriented simplices, thereby increasing the degree by n while adding n+2 new vertices. Summing over k steps yields the claimed bound.

Theorem 2 provides an exact recursive formula for the case n ≥ d:
 λ(n,d) = λ(d−1,d) + n − d + 1.
The inequality λ(n,d) ≤ λ(d−1,d) + n − d + 1 follows from iterating Lemma 1 downward, while Lemma 3 supplies the opposite inequality, forcing equality. This result reduces the computation of λ for any high dimension to the computation in the “critical” dimension d−1.

Theorem 3 resolves the values for the three smallest non‑trivial degrees d = 2, 3, 4:
 λ(n,2) = n + 5, λ(n,3) = n + 6, λ(n,4) = n + 7 for all n ≥ d−1.
The base cases λ(1,2)=6, λ(2,3)=8, and λ(3,4)=10 are established directly. Lemma 4 supplies a detailed construction for λ(3,4)=10, showing that ten vertices suffice and that fewer are impossible. Applying Theorem 2 then yields the linear formulas for all higher n.

The paper concludes with an open problem concerning the asymptotic growth of λ(n,d) as d → ∞. Defining ω by the condition
 lim sup_{d→∞} λ(n,d) / d^ω < ∞,
Ryabichev’s recent work shows ω < 1, indicating sub‑linear growth in d. Determining the exact exponent remains an interesting direction for future research.

Overall, the work blends constructive combinatorial topology with careful counting arguments to obtain both general bounds and exact formulas for minimal vertex counts of degree‑d simplicial maps from spheres to simplex boundaries. The recursive identity λ(n,d)=λ(d−1,d)+n−d+1 is particularly powerful, as it reduces high‑dimensional cases to a finite set of low‑dimensional computations, and the explicit formulas for d=2,3,4 settle previously conjectured optimality of the linear bound λ(n,d) ≤ n+d+3.