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

We study the geodesic growth series of the braid group on three strands, B_3 := <a,b|aba = bab>. We show that the set of geodesics of B_3 with respect to the generating set S := {a,b,a^-1,b^-1} is a regular language, and we provide an…

Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…

Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…

We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

Knot theory is an active field of mathematics, in which combinatorial and computational methods play an important role. One side of computational knot theory, that has gained interest in recent years, both for complexity analysis and…

Define the length of a finite presentation of a group $G$ as the sum of lengths of all relators plus the number of generators. How large can be the $k$th Betti number $b_k(G)=$ rank $H_k(G)$ providing that $G$ has length $\leq N$ and…

We present a new procedure to determine the growth function of a homogeneous Garside monoid, with respect to the finite generating set formed by the atoms. In particular, we present a formula for the growth function of each Artin--Tits…

We give a method to produce representations of the braid group $B_n$ of $n-1$ generators ($n\leq \infty$). Moreover, we give sufficient conditions over a non unitary representation for being of this type. This method produces examples of…

When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the…

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

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}$…

It is known that the Lawrence-Krammer representation of the Artin group of type $A_{n-1}$ based on the two parameters $t$ and $q$ that was used by Krammer and independently by Bigelow to show the linearity of the braid group on $n$ strands…

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…

This paper represents a first attempt at unifying two promising models that attempt to explain the origin of the internal symmetries of leptons and quarks. It is shown that each of the four normed division algebras over the reals admits a…

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…

We give a quadratic-time explicit and computable algorithm to solve the word problem for Artin groups that do not contain any relations of length 3. Furthermore, we prove that, given two geodesic words representing the same element, one can…

A Garside group is a group admitting a finite lattice generating set D. Using techniques developed by Bestvina for Artin groups of finite type, we construct K(\pi,1)s for Garside groups. This construction shows that the (co)homology of any…

We give a method to produce faithful representations of the groups $G(n,m)=\langle X, Y \ \vert \ X^m = Y^n \rangle$ in $\mathrm{GL}_2(\mathbb{C}[t^{\pm 1}, q^{\pm 1}])$. These groups are Garside groups and the Garside normal forms of…

In this paper, we obtain Groebner-Shirshov (non-commutative Gr\"obner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word" $\delta$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form…