arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.0137math.GRmath.GT
收藏

辫群中关系的复杂性

Complexity of relations in the braid group

Joel Hass, Arkadius Kalka, Tahl Nowik

摘要:

我们表明,对于任何给定的n,存在一个序列的字a_k中的生成器sigma_1,.表示B_n的单位元的辫群B_n的sigma_{n-1},使得从a_k传递到空字所需的形式为sigma_i sigma_{i+1} sigma_i = sigma_{i+1} sigma_i sigma_{i+1}的辫关系的数量相对于a_k的长度是二次的。

英文摘要:

We show that for any given n, there exists a sequence of words a_k in the generators sigma_1, ... sigma_{n-1} of the braid group B_n, representing the identity element of B_n, such that the number of braid relations of the form sigma_i sigma_{i+1} sigma_i = sigma_{i+1} sigma_i sigma_{i+1} needed to pass from a_k to the empty word is quadratic with respect to the length of a_k.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑