Searcharxiv⌕ Search

arXiv subjects

Stephen Bigelow

Publications and source records attributed to Stephen Bigelow.

21 records · Page 2Linked to original sources

A homological definition of the Jones polynomial

We give a new definition of the Jones polynomial. Let L be an oriented knot or link obtained as the plat closure of a braid beta in B_{2n}. We define a covering space tilde{C} of the space of unordered n-tuples of distinct points in the 2n-punctured disk. We then describe two n-manifolds tilde{S} and tilde{T} in tilde{C}, and show that the Jones polynomial of L can be defined as an intersection pairing between tilde{S} and beta tilde{T}. Our construction is similar to one given by Lawrence, but more concrete.

math.GT↗

The Lawrence-Krammer representation

The Lawrence-Krammer representation of the braid groups recently came to prominence when it was shown to be faithful by myself and Krammer. It is an action of the braid group on a certain homology module $H_2(\tilde{C})$ over the ring of Laurent polynomials in $q$ and $t$. In this paper we describe some surfaces in $\tilde{C}$ representing elements of homology. We use these to give a new proof that $H_2(\tilde{C})$ is a free module. We also show that the $(n-2,2)$ representation of the Temperley-Lieb algebra is the image of a map to relative homology at $t=-q^{-1}$, clarifying work of Lawrence.

math.GT↗

The Burau representation is not faithful for n = 5

The Burau representation is a natural action of the braid group B_n on the free Z[t,t^{-1}]-module of rank n-1. It is a longstanding open problem to determine for which values of n this representation is faithful. It is known to be faithful for n=3. Moody has shown that it is not faithful for n>8 and Long and Paton improved on Moody's techniques to bring this down to n>5. Their construction uses a simple closed curve on the 6-punctured disc with certain homological properties. In this paper we give such a curve on the 5-punctured disc, thus proving that the Burau representation is not faithful for n>4.

math.GT↗