相关论文: Garside groups are strongly translation discrete

In this work, we address a question posed by Dehornoy et al. in the book "Foundations of Garside Theory" that asks for a theory of groups of $\mathrm{I}_G$-type when $G$ is a Garside group. In this article, we introduce a broader notion…

This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group G is a finite set…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

In this paper, we show that for every abelian subgroup $H$ of a Garside group, some conjugate $g^{-1}Hg$ consists of ultra summit elements and the centralizer of $H$ is a finite index subgroup of the normalizer of $H$. Combining with the…

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

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…

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

We introduce and investigate the ribbon groupoid associated with a Garside group. Under a technical hypothesis, we prove that this category is a Garside groupoid. We decompose this groupoid into a semi-direct product of two of its parabolic…

A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…

We define the notion of preGarside group slightly lightening the definition of Garside group so that all Artin-Tits groups are preGarside groups. This paper intends to give a first basic study on these groups. Firstly, we introduce the…

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…

We give a new presentation of the braid group $B$ of the complex reflection group $G(e,e,r)$ which is positive and homogeneous, and for which the generators map to reflections in the corresponding complex reflection group. We show that this…

Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group,…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

In this note we connect the language of Bessis's Garisde categories with Salvetti's metrical-hemisphere complexes in order to find new examples of weak Garside groups. As our main example, we show that the fundamental group of the…

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 the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

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

Garside families have recently emerged as a relevant context for extending results involving Garside monoids and groups, which themselves extend the classical theory of (generalized) braid groups. Here we establish various characterizations…

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…