Explore the Vietoris-Rips complexes of hypercube graphs in this 34-minute talk from the Applied Algebraic Topology Network. Delve into the concept of d-collapsibility in finite simplicial complexes and its relation to genetic trees, reticulate evolution, and medial recombination. Examine the collapsibility number and its significance in reducing complexes to void complexes. Investigate the representability number and its implications. Analyze the supporting arguments for the presented results, focusing on the Maximum Minimum Principle and its application to collapsibility numbers in Vietoris-Rips complexes of hypercube graphs.
Overview
Syllabus
Introduction
What is collapsibility number
What is representability number
Results
Supporting Argument
Collapsibility Number
Colapsibility Number
Maximum Minimum Principle
Taught by
Applied Algebraic Topology Network
Related Courses
-
Henry Adams - Vietoris-Rips Complexes of Hypercube Graphs
-
Star Clusters in Clique Complexes and the Vietoris-Rips Complex of Planar Sets
-
Homotopical Decompositions of Simplicial and Vietoris Rips Complexes
-
The Vietoris Rips Complex of the Circle
-
Vietoris-Rips Thickenings - Problems for Birds and Frogs
-
Decomposing Simplicial Complexes - Without Losing Pieces
