15:30
PL recognition after two $S^2\times S^2$ stabilisations is PSPACE-hard
Abstract
Let $Z$ be any fixed closed connected PL 4-manifold. We give a reduction from the compressed word problem in Thompson's group $F$ to fixed-target recognition of $Z\#_2(S^2\times S^2)$. Once a finite triangulation of $Z$ has been fixed, the construction sends a straight-line program $A$ to a closed triangulated PL 4-manifold $X_{A,Z}$ such that a designated output word $\operatorname{val}(A)$ is equal to the identity in $F$ if and only if $X_{A,Z}$ is PL-homeomorphic to $Z\#_2(S^2\times S^2)$. The compressed word problem in $F$ has been shown to be PSPACE-complete, and so every such recognition problem is PSPACE-hard. In particular, fixed-target recognition of $\#_n(S^2\times S^2)$ is PSPACE-hard for every fixed $n\geq 2$.