Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 385 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Noncrossing partitions for periodic braids (1608.05879v2)

Published 21 Aug 2016 in math.GT

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

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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