2025/02/12 by José Ayala, Joel Hass, Ayala, José +1
Computer Science · Mathematics · #49Q10 #53C42 #57K10 #57K35 #Complexity and Algorithms in Graphs #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.2502.08499
openalex publication_date 2025/02/12 · openalex created_date 2025/02/15 · openalex updated_date 2026/07/28
This paper gives the first examples of gordian unlinks. The components of these unlinks cannot be separated while maintaining constant length and thickness. We construct infinite families of 2-component gordian unlinks and also construct n-component gordian unlinks for each n ≥ 2.