Related papers: Garside groups are strongly translation discrete

The main result of the paper is that if $A$ is an abelian variety over a subfield $F$ of ${\bold C}$, and $A$ has purely multiplicative reduction at a discrete valuation of $F$, then the Hodge group of $A$ is semisimple. Further, we give…

Let $k$ be a field and let $G$ be an affine algebraic group over $k$. Call a $G$-torsor weakly versal for a class of $k$-schemes $\cal C$ if it specializes to every $G$-torsor over a scheme in $\cal C$. A recent result of the first author,…

In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…

Let $G$ be a finite group and, for a given complex character $\chi$ of $G$, let ${\mathbb{Q}}(\chi)$ denote the field extension of ${\mathbb{Q}}$ obtained by adjoining all the values $\chi(g)$, for $g\in G$. The group $G$ is called…

We introduce a relative Garside element, the quotient of the corresponding Garside elements G1 and G2, for a pair of Artin monoids associated to Coxeter graphs Gamma1 and Gamma2, the second graph containing a new vertex. These relative…

We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice,…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

We define geodesic normal forms for the general series of complex reflection groups G(e,e,n). This requires the elaboration of a combinatorial technique in order to explicitly determine minimal word representatives of the elements of…

An element in Artin's braid group $B_n$ is called periodic if it has a power which lies in the center of $B_n$. The conjugacy problem for periodic braids can be reduced to the following: given a divisor $1\le d<n-1$ of $n-1$ and an element…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We show that each of the Artin groups of type $B_n$ and $D_n$ can be presented as a semidirect product $F \rtimes {\cal B}_n$, where $F$ is a free group and ${\cal B}_n$ is the $n$-string braid group. We explain how these semidirect product…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

Let $G$ be a group and $g$ a non-trivial element in $G$. If some non-empty finite product of conjugates of $g$ equals to the identity, then $g$ is called a generalized torsion element. The minimum number of conjugates in such a product is…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

Given a group $G$ with bounded torsion that acts properly on a systolic complex, we show that every solvable subgroup of $G$ is finitely generated and virtually abelian of rank at most $2$. In particular this gives a new proof of the above…

Right-reversing is an algorithm used to compute least common multiples in monoids that admit a right-complemented presentation. The algorithm can either terminate and find a result, fail, or run indefinitely. The correctness of the…

This paper shows how to construct coherent presentations (presentations by generators, relations and relations among relations) of monoids admitting a right-noetherian Garside family. Thereby, it resolves the question of finding a unifying…

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…