Related papers: Garside shadows and biautomatic structures in Coxe…

Let $(W,S)$ be a Coxeter system, $S$ finite, and let $G_{W}$ be the associated Artin group. One has configuration spaces $Y,\ Y_{W},$ where $G_{W}=\pi_1(Y_{W}),$ and a natural $W$-covering $f_{W}:\ Y\to Y_{W}.$ The Schwarz genus $g(f_{W})$…

The mapping class group of a non-exceptional oriented surface of finite type admits a biautomatic structure.

Let C be a one- or two-sided Kazhdan--Lusztig cell in a Coxeter group (W,S), and let Reduced(C) denote the set of reduced expressions of all w in C, regarded as a language over the alphabet S. Casselman has conjectured that Reduced(C) is…

Let $G$ be a Garside group endowed with the generating set $\mathcal{S}$ of non-trivial simple elements, and let $H$ be a parabolic subgroup of $G$. We determine a transversal $T$ of $H$ in $G$ such that each $\theta \in T$ is of minimal…

Many physically important mechanical systems may be described with a Lie group $G$ as configuration space. According to the well-known Noether's theorem, underlying symmetries of the Lie group may be used to considerably reduce the…

In this paper we describe a family of isomorphism invariants of a finitely generated Coxeter group W. Each of these invariants is the isomorphism type of a quotient group W/N of W by a characteristic subgroup N. The virtue of these…

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

We characterize coset spaces of topological groups which are coset spaces of (separable) metrizable groups and complete metrizable (Polish) groups. Besides, it is shown that for a $G$-space $X$ with a $d$-open action there is a topological…

For a Coxeter group $W$ we have an associating bi-linear form $B$ on suitable real vector space. We assume that $B$ has the signature $(n-1,1)$ and all the bi-linear form associating rank $n' (\ge 3)$ Coxeter subgroups generated by subsets…

In this article, we investigate the set of $\gamma$-sortable elements, associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, under Bruhat order, and we denote this poset by $\mathcal{B}_{\gamma}$. We show that this poset…

We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple…

Given a finitely generated relatively hyperbolic group $G$, we construct a finite generating set $X$ of $G$ such that $(G,X)$ has the `falsification by fellow traveler property' provided that the parabolic subgroups $\{H_\omega\}_{\omega\in…

Let $W$ be a right-angled Coxeter group corresponding to a finite non-discrete graph $\mathcal{G}$ with at least $3$ vertices. Our main theorem says that $\mathcal{G}^c$ is connected if and only if for any infinite index quasiconvex…

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group $W$ acting on the $p$th graded component of its Orlik-Solomon algebra as a sum of characters induced from linear…

We show that the set $SA(G)$ of equivalence classes of synchronously automatic structures on a geometrically finite hyperbolic group $G$ is dense in the product of the sets $SA(P)$ over all maximal parabolic subgroups $P$. The set $BSA(G)$…

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…

In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we…

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…

A general result of Epstein and Thurston implies that all link groups are automatic, but the proof provides no explicit automaton. Here we show that the groups of all torus links are groups of fractions of so-called Garside monoids, i.e.,…