TL;DR
This paper introduces smooth concordance and sliceness concepts for spatial graphs, establishing that sliceness relates to linking numbers and associated link sliceness, extending Taniyama's results for theta-curves.
Contribution
It generalizes Taniyama's theorem by defining sliceness for spatial graphs and relating it to linking numbers and link sliceness.
Findings
Sliceness of a spatial graph is characterized by linking numbers and associated link sliceness.
Provides a new framework for understanding concordance in spatial graphs.
Extends known results from theta-curves to more general spatial graphs.
Abstract
We define smooth notions of concordance and sliceness for spatial graphs. We prove that sliceness of a spatial graph is equivalent to a condition on a set of linking numbers together with sliceness of a link associated to the graph. This generalizes the result of Taniyama for -curves.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Computational Geometry and Mesh Generation · Geometric and Algebraic Topology