arXiv Analytics

Sign in

arXiv:1608.05879 [math.GT]AbstractReferencesReviewsResources

Noncrossing partitions for periodic braids

Eon-Kyung Lee, Sang-Jin Lee

Published 2016-08-21Version 1

An element in Artin's braid group $B_n$ is called periodic if it has a power which lies in the center of $B_n$. The conjugacy problem for periodic braids can be reduced to the following: given a divisor $1\le d<n-1$ of $n-1$ and an element $\alpha$ in the super summit set of $\epsilon^d$, find $\gamma\in B_n$ such that $\gamma^{-1}\alpha\gamma=\epsilon^d$, where $\epsilon=(\sigma_{n-1}\cdots\sigma_1)\sigma_1$. In this article we characterize the elements in the super summit set of $\epsilon^d$ in the dual Garside structure by studying the combinatorics of noncrossing partitions arising from periodic braids. Our characterization directly provides a conjugating element $\gamma$. And it determines the size of the super summit set of $\epsilon^d$ by using the zeta polynomial of the noncrossing partition lattice.

Related articles: Most relevant | Search more
arXiv:math/0702349 [math.GT] (Published 2007-02-13, updated 2010-04-29)
Conjugacy classes of periodic braids
arXiv:math/0611454 [math.GT] (Published 2006-11-15, updated 2006-12-05)
A fast algorithm to the conjugacy problem on generic braids
arXiv:math/9712211 [math.GT] (Published 1997-12-02, updated 1998-04-07)
A new approach to the word and conjugacy problems in the braid groups