Papers
Topics
Authors
Recent
Search
2000 character limit reached

Simplicial degree dd self-maps on nn-spheres

Published 2 Sep 2024 in math.GT | (2409.00907v1)

Abstract: The degree of a map between orientable manifolds is a crucial concept in topology, providing deep insights into the structure and properties of the manifolds and the corresponding maps. This concept has been thoroughly investigated, particularly in the realm of simplicial maps between orientable triangulable spaces. In this paper, we concentrate on constructing simplicial degree dd self-maps on nn-spheres. We describe the construction of several such maps, demonstrating that for every d∈Z∖0d \in \mathbb{Z} \setminus {0}, there exists a degree dd simplicial map from a triangulated nn-sphere with $3|d| + n - 1$ vertices to S<sup>nn+2\mathbb{S}<sup>n_{n+2}. Further, we prove that, for every d∈Z∖0d \in \mathbb{Z} \setminus {0}, there exists a simplicial map of degree $3 d$ from a triangulated nn-sphere with $6|d| + n$ vertices, as well as a simplicial map of degree 3d+d∣d∣3d+\frac{d}{|d|} from a triangulated nn-sphere with $6|d|+n+3$ vertices, to S<sup>nn+2\mathbb{S}<sup>{n}_{n+2}. Furthermore, we show that for any ∣k∣≥2|k| \geq 2 and n≥∣k∣n \geq |k|, a degree kk simplicial map exists from a triangulated nn-sphere KK with ∣k∣+n+3|k| + n + 3 vertices to S<sup>nn+2\mathbb{S}<sup>n_{n+2}. We also prove that for d=2d = 2 and 3, these constructions produce vertex-minimal degree dd self-maps of nn-spheres. Additionally, for every n≥2n \geq 2, we construct a degree n+1n+1 simplicial map from a triangulated nn-sphere with $2n + 4$ vertices to S<sup>nn+2\mathbb{S}<sup>{n}_{n+2}. We also prove that this construction provides facet minimal degree n+1n+1 self-maps of nn-spheres.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.