2000 character limit reached
On the Burau representation of $B_3$ modulo $p$
Published 20 Jun 2024 in math.GT and math.GR | (2406.14538v1)
Abstract: We present an algorithm that, given a prime $p$ as input, determines whether or not the Burau representation of the 3-strand braid group modulo $p$ is faithful. We also prove that the representation is indeed faithful when $p\le 13$. Additionally, we re-pose Salter's question on the Burau representation of $B_3$ over finite fields $\mathbb{F}_p$, and solve it for every $p$.
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.