Related papers: Coxeter systems for which the Brink-Howlett automa…

In this article, we introduce and investigate a class of finite deterministic automata that all recognize the language of reduced words of a finitely generated Coxeter system (W,S). The definition of these automata is straightforward as it…

In this paper, we study the minimality of the boundary of a Coxeter system. We show that for a Coxeter system $(W,S)$ if there exist a maximal spherical subset $T$ of $S$ and an element $s_0\in S$ such that $m(s_0,t)\ge 3$ for each $t\in T$…

In this paper, we show that the boundary $\partial\Sigma(W,S)$ of a right-angled Coxeter system $(W,S)$ is minimal if and only if $W_{\tilde{S}}$ is irreducible, where $W_{\tilde{S}}$ is the minimum parabolic subgroup of finite index in…

In this article we provide a new finite class of elements in any Coxeter system (W,S) called low elements. They are defined from Brink and Howlett's small roots, which are strongly linked to the automatic structure of (W,S). Our first main…

In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…

We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an…

If $x$ and $y$ are roots in the root system with respect to the standard (Tits) geometric realization of a Coxeter group $W$, we say that $x$ \emph{dominates} $y$ if for all $w\in W$, $wy$ is a negative root whenever $wx$ is a negative…

In the recent paper (Casselman, 2001) I described how a number of ideas due to Fokko du Cloux and myself could be incorporated into a reasonably efficient program to carry out multiplication in arbitrary Coxeter groups. At the end of that…

We show that the standard generating set of a Coxeter group is of minimal cardinality provided that the non-diagonal entries of the Coxeter matrix are sufficiently large.

We prove that certain families of Coxeter groups and inclusions $W_1\hookrightarrow W_2\hookrightarrow...$ satisfy homological stability, meaning that in each degree the homology $H_\ast(BW_n)$ is eventually independent of $n$. This gives a…

In this paper, we study the twist-conjecture for Coxeter systems and rigidity of Coxeter systems up to finite twists. For Coxeter systems $(W,R)$ and $(W,S)$, under the untangle-condition for conjugate subsets, we investigate separations…

We study the cohomology ring of the Bott--Samelson variety. We compute an explicit presentation of this ring via Soergel's result, which implies that it is a purely combinatorial invariant. We use the presentation to introduce the…

In this extended abstract we announce a proof that, in a Coxeter group of rank 3, low elements are in bijection with small inversion sets. This gives a partial confirmation of Conjecture 2 in [Dyer, Hohlweg '16]. That same article provides…

In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes.…

Weak Bruhat interval modules of the $0$-Hecke algebra in type $A$ provide a uniform approach to studying modules associated with noteworthy families of quasisymmetric functions. Recently this kind of modules were generalized from type $A$…

Any two reduced expressions for the same Coxeter group element are related by a sequence of commutation and braid moves. Two reduced expressions are said to be braid equivalent if they are related via a sequence of braid moves. Braid…

We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on…

We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is…

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…

We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…