2000 character limit reached
A new algorithm for 3-sphere recognition
Published 13 Oct 2016 in math.GT and math.GR | (1610.04092v2)
Abstract: We prove the existence of a new algorithm for 3-sphere recognition based on Groebner basis methods applied to the variety of $\text{\em SL}(2,\C)$-representation of the fundamental group. An essential input is a recent result of the second author, stating that any integer homology 3-sphere different from the 3-sphere admits an irreducible representation of its fundamental group in $\text{\em SL}(2,\C)$. This result, and hence our algorithm, build on the geometrisation theorem of 3-manifolds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.