Ribbon Complexes & their Approximate Descriptive Proximities. Ribbon & Vortex Nerves, Betti Numbers and Planar Divisions
James F. Peters

TL;DR
This paper introduces planar ribbons, ribbon complexes, and ribbon nerves within CW topological spaces, analyzing their Betti numbers, homotopy types, and proximity relations, with applications to planar divisions and fixed points.
Contribution
It defines and characterizes ribbon complexes and nerves in CW spaces, introduces new Betti numbers for these structures, and explores their homotopy types and proximity properties.
Findings
Betti numbers for ribbons and nerves are introduced.
Results on ribbon collections with approximate proximity are provided.
Homotopy types of ribbons and nerves are characterized.
Abstract
This article introduces planar ribbons, Vergili ribbon complexes and ribbon nerves in Alexandroff-Hopf-Whitehead CW (Closure finite Weak) topological spaces. A {\em planar ribbon} (briefly, {ribbon}) in a CW space is the closure of a pair of nesting, non-concentric filled cycles that includes the boundary but does not include the interior of the inner cycle. Each planar ribbon has its own distinctive shape determined by its outer and inner boundaries and the interior within its boundaries. A Vergili ribbon complex (briefly, ribbon complex) in a CW space is a non-void collection of countable planar ribbons. A ribbon nerve is a nonvoid collection of planar ribbons (members of a ribbon complex) that have nonempty intersection. A planar CW space is a non-void collection of cells (vertexes, edges and filled triangles) that may or may not be attached to other and which satisfy…
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
TopicsAdvanced Theoretical and Applied Studies in Material Sciences and Geometry · Robotic Path Planning Algorithms
