A Garside-theoretic approach to the reducibility problem in braid groups
A Garside-theoretic approach to the reducibility problem in braid groups
复制标题
辫子群中可还原性问题的加赛德理论方法
DOI:
10.1016/j.jalgebra.2008.03.033
复制
发表时间:
2005
期刊:
影响因子:
--
通讯作者:
Sangjin Lee
中科院分区:
文献类型:
--
作者:
Eonkyung Lee;Sangjin Lee
Let Dndenote the n-punctured disk in the complex plane, where the punctures are on the real axis. An n-braid α is said to be reducible if there exists an essential curve system C in Dn, called a reduction system of α, such that α*C=C where α*C denotes the action of the braid α on the curve system C. A curve system C in Dnis said to be standard if each of its components is isotopic to a round circle centered at the real axis. In this paper, we study the characteristics of the braids sending a curve system to a standard curve system, and then the characteristics of the conjugacy classes of reducible braids. For an essential curve system C in Dn, we define the standardizer of C as St(C)={P∈Bn+:P∗C is standard} and show that St(C) is a sublattice of Bn+. In particular, there exists a unique minimal element in St(C). Exploiting the minimal elements of standardizers together with canonical reduction systems of reducible braids, we define the outermost component of reducible braids, and then show that, for the reducible braids whose outermost component is simpler than the whole braid (including split braids), each element of its ultra summit set has a standard reduction system. This implies that, for such braids, finding a reduction system is as easy as finding a single element of the ultra summit set.