L. A. Bokut
In this paper, we obtain Groebner-Shirshov (non-commutative Gröbner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word" $δ$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form in the braid groups, and thus a new algorithm for solving the word problem in these groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$ is the subsemigroup in $B_{n+1}$.
We construct a class of Garside groupoid structures on the pure braid groups, one for each function (called labelling) from the punctures to the integers greater than 1. The object set of the groupoid is the set of ball decompositions of the punctured disk; the labels are the perimeters of the regions. Our construction generalises Garside's original Garside structure, but not the one by Birman-Ko-Lee. As a consequence, we generalise the Tamari lattice ordering on the set of vertices of the associahedron.
We construct a quasi-Garside monoid structure for the free group. This monoid should be thought of as a dual braid monoid for the free group, generalising the constructions by Birman-Ko-Lee and by the author of new Garside monoids for Artin groups of spherical type. Conjecturally, an analog construction should be available for arbitrary Artin groups and for braid groups of well-generated complex reflection groups.
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
We construct a new monoid structure for Artin groups associated with finite Coxeter systems. This monoid shares with the classical positive braid monoid a crucial algebraic property: it is a Garside monoid. The analogy with the classical construction indicates there is a ``dual'' way of studying Coxeter systems, where the pair (W,S) is replaced by (W,T), with T the set of all reflections. In the type A case, we recover the monoid constructed by Birman-Ko-Lee
Birman, Ko and Lee have introduced a new monoid ${\cal B}^{*}_{n}$--with an explicit presentation--whose group of fractions is the $n$-strand braid group ${\cal B}_{n}$. Building on a new approach by Digne, Michel and himself, Bessis has defined a {\it dual} braid monoid for every finite Coxeter type Artin-Tits group extending the type A case. Here, we give an explicit presentation for this dual braid monoid in the case of types B and D, and we study the combinatorics of the underlying Garside structures.
In [J.Birman, V.Gebhardt, J.Gonzalez-Meneses, Conjugacy in Garside groups I: cyclings, powers and rigidity] authors asked: (open question 2) is the size of USS of a rigid pseudo-Anosov braid is bounded above by some polynomial in the number of strands and the braid length? We answer this question in the negative.
Garside's results and the existense of the greedy normal form for braids are shown to be true for the singular braid monoid. An analogue of the presentation of J. S. Birman, K. H. Ko and S. J. Lee for the braid group is also obtained for this monoid.
We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks: Length functions. After a self-contained introduction to Garside groups, we describe length functions induced by the greedy normal form and by the rational normal form in these groups, and compare their worst-case performances. Our main concern is Artin's braid groups, with their two known Garside presentations, due to Artin and due to Birman-Ko-Lee (BKL). We sho…
Recently, there have been several progresses for the conjugacy search problem (CSP) in Garside groups, especially in braid groups. All known algorithms for solving this problem use a sort of exhaustive search in a particular finite set such as the super summit set and the ultra summit set. Their complexities are proportional to the size of the finite set, even when there exist very short conjugating elements. However, ultra summit sets are very large in some cases especially for reducible braids and periodic braids. Some possible approaches to resolve this difficulty would be either to use dif…
We study Artin-Tits braid groups $\mathbb{B}_W$ of type ADE via the action of $\mathbb{B}_W$ on the homotopy category $\mathcal{K}$ of graded projective zigzag modules (which categorifies the action of the Weyl group $W$ on the root lattice). Following Brav-Thomas, we define a metric on $\mathbb{B}_W$ induced by the canonical $t$-structure on $\mathcal{K}$, and prove that this metric on $\mathbb{B}_W$ agrees with the word-length metric in the canonical generators of the standard positive monoid $\mathbb{B}_W^+$ of the braid group. We also define, for each choice of a Coxeter element $c$ in $W$…
We define geodesic normal forms for the general series of complex reflection groups G(de,e,n). This requires the elaboration of a combinatorial technique in order to determine minimal word representatives and to compute the length of the elements of G(de,e,n) over some generating set. Using these geodesic normal forms, we construct intervals in G(e,e,n) that give rise to Garside groups. Some of these groups correspond to the complex braid group B(e,e,n). For the other Garside groups that appear, we study some of their properties and compute their second integral homology groups. Inspired by th…
We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super summit set to arbitrary dimensions. One key ingredient in our solution is the introduction of a provable high-dimensional version of the Birman--Ko--Lee cycling theorem. The complexity of this solution is a small degree polynomial in the cardinalities of our generalized super summit sets and the input parameters. Computer experiments suggest that the cardinalit…
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors increases, the success probability converges to 1 and so, contrary to the common belief, the distribution of hard instances for the conjugacy problem is getting sparser. We also prove a conjecture by Birman a…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。