6 papers
Topological perspectives on the vanishing of some Bogomolov multipliers
Eric Samperton, Carlos Segovia
Since the 1980s, the Bogomolov multiplier of a finite group has been known to obstruct rationality in complex algebraic geometry, and more recently it is understood to be responsib…
Obstruction theory and the complexity of counting group homomorphisms
Eric Samperton, Armin WeiÃ
Fix a finite group . We study the computational complexity of counting problems of the following flavor: given a group , count the number of homomorphisms . Our fir…
On the hardness of approximating minimum distances of quantum codes
Elena Grigorescu, Vatsal Jha, Eric Samperton
The problem of computing distances of error-correcting codes is fundamental in both the classical and quantum settings. While hardness for the classical version of these problems h…
An elementary proof that linking problems are hard
Shannon Cheng, Anna Chlopecki, Saarah Nazar +1
We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is -hard -- name…
Towards a complexity-theoretic dichotomy for TQFT invariants
Nicolas Bridges, Eric Samperton
We show that for any fixed -dimensional TQFT over of either Turaev-Viro-Barrett-Westbury or Reshetikhin-Turaev type, the problem of (exactly) computing its inva…
An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number
Colleen Delaney, Clément Maria, Eric Samperton
Quantum topology provides various frameworks for defining and computing invariants of manifolds inspired by quantum theory. One such framework of substantial interest in both mathe…