arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.02488math.GTmath.GR

辫群中的Hilden双陪集问题

The Hilden Double Coset Problem in Braid Groups

Seth Hovland

AI总结:

本文解决了辫群模Hilden子群的双陪集问题,证明平结闭包的链环问题稳定等价于可解代数问题,并利用Garside分解方法。

摘要:

本文解决了辫群$B_n$模Hilden子群$H_n$的双陪集问题。该结果表明,与辫闭包情形类似,平结闭包的链环问题“稳定等价”于一个可解的代数问题。证明的一个特别有趣的特点是,如同Garside对字问题和共轭问题的解法,它也依赖于Garside对$B_n$中辫的分解。

英文摘要:

In this paper we provide a solution to the double coset problem for the braid group $B_n$ modulo the Hilden subgroup $H_n.$ This result demonstrates that, as in the case of braid closures, the Link Problem for plat closures is "stably equivalent" to a solvable algebraic problem. A particularly interesting feature of the proof is that, like Garside's solutions to the Word and Conjugacy Problems, it too relies on Garside's decomposition of braids in $B_n.$

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

↑