Related papers: Garside shadows and biautomatic structures in Coxe…

The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

We describe a new presentation for the complex reflection groups of type $(e,e,r)$ and their braid groups. A diagram for this presentation is proposed. The presentation is a monoid presentation which is shown to give rise to a Garside…

The isomorphism problem for Coxeter groups has been reduced to its 'reflection preserving version' by B. Howlett and the second author. Thus, in order to solve it, it suffices to determine for a given Coxeter system (W,R) all Coxeter…

In the present paper we define dual monoids for all Artin-Tits groups and we prove that for the type $\tilde A_n$ we get a (quasi)-Garside structure. Such a structure provides normal forms for the Artin-Tits group elements and allows to…

Let (W,S) be an infinite Coxeter system. To each geometric representation of W is associated a root system. While a root system lives in the positive side of the isotropy cone of its associated bilinear form, an imaginary cone lives in the…

Let $ (W,S)$ be a Coxeter system. We investigate the equation $ w(\Phi_{x}) = \Phi_{y}$ where $ w,x,y\in W$ and $ \Phi_{x}$, $\Phi_{y}$ denote the left inversion sets of $ x$ and $ y$. We then define a commutative square diagram called a…

By Tits' deformation argument, a generic Iwahori--Hecke algebra $H$ associated to a finite Coxeter group $W$ is abstractly isomorphic to the group algebra of $W$. Lusztig has shown how one can construct an explicit isomorphism, provided…

Let $W$ be a Coxeter group. We provide a precise description of the conjugacy classes in $W$, in the spirit of Matsumoto's theorem. This extends to all Coxeter groups an important result on finite Coxeter groups by M. Geck and G. Pfeiffer…

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 prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in…

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…

Following the research from the paper "Triangles, squares and geodesics" (arXiv:0910.5688) of Rena Levitt and Jon McCammond we investigate the properties of groups acting on CAT(0) triangle-square complexes, focusing mostly on…

When W is a finite reflection group, the noncrossing partition lattice NCP_W of type W is a rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. A formula (for which the only known proofs are case-by-case)…

We follow the dual approach to Coxeter systems and show for Weyl groups a criterium which decides whether a set of reflections is generating the group depending on the root and the coroot lattice. Further we study special generating sets…