Papers
Topics
Authors
Recent
Search
2000 character limit reached

Noncrossing partitions for periodic braids

Published 21 Aug 2016 in math.GT | (1608.05879v2)

Abstract: 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 $\epsilond$, find $\gamma\in B_n$ such that $\gamma{-1}\alpha\gamma=\epsilond$, where $\epsilon=(\sigma_{n-1}\cdots\sigma_1)\sigma_1$. In this article we characterize the elements in the super summit set of $\epsilond$ 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 $\epsilond$ by using the zeta polynomial of the noncrossing partition lattice.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.