相关论文: Solving random equations in Garside groups using l…

M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace…

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which…

In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…

We define a representation of the Artin groups of type ADE by monodromy of generalized KZ-systems which is shown to be isomorphic to the generalized Krammer representation originally defined by A.M. Cohen and D. Wales, and independantly by…

This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.

Traditional symbolic reasoning engines, while attractive for their precision and explicability, have a few major drawbacks: the use of brittle inference procedures that rely on exact matching (unification) of logical terms, an inability to…

Algebraic codes that achieve list decoding capacity were recently constructed by a careful ``folding'' of the Reed-Solomon code. The ``low-degree'' nature of this folding operation was crucial to the list decoding algorithm. We show how…

We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…

In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

We prove that the word problem in an Artin group G based on a diagram without A_3 or B_3 subdiagrams can be solved using a system of length preserving rewrite rules which, together with free reduction, can be used to reduce any word over…

There exists a multiplicative homomorphism from the braid group B to the Temperley-Lieb algebra TL. Moreover, the homomorphic images in TL of the simple elements form a basis for the vector space underlying TL. In analogy with the case of…

We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…

These are lecture notes from a lecture series given at CIRM in the Fall 2023. They give a down-to-earth introduction to Khovanov and Seidel's categorical representation of Artin-Tits groups, emphasizing the fact that it is all explicitly…

For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…

The so-called block-term decomposition (BTD) tensor model, especially in its rank-$(L_r,L_r,1)$ version, has been recently receiving increasing attention due to its enhanced ability of representing systems and signals that are composed of…

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

In [1] we have constructed a [n+1/2]+1 parameters family of irreducible representations of the Braid group B_3 in arbitrary dimension using a $q-$deformation of the Pascal triangle. This construction extends in particular results by S.P.…

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…