A diagram with several parts linked by arrows and the statement of a theorem. Theorem: The trivial sublink problem is NP-hard. Diagram: A of a graph (network) on 5 vertices with 5 distinct colors, along with its 5x5 adjacency matrix (0s and 1s) With an arrow that says "Build braid word" to a 5-strand braid, where each of the five strands has a color corresponding to one of the 5 vertices. An arrow from the braid that say s"Take trace closure of braid (and simplify greedily)" Pointing to a 5-component link, where each component has a color corresponding to the color of one of the strands.
Online CS Theory Seminar this Fri 2026-03-27!
We're excited to have Eric Samperton (Purdue Uni.) presenting "Complexity of Algebraic Problems in Low-Dimensional Topology"
www.math.purdue.edu/~esampert/
www.colorado.edu/cs-theory/th...
#MathSky #TCSSky #complexity #topology