Related papers: Cone Types, Automata, and Regular Partitions in Co…
Small Coxeter groups are exactly those for which the Tits representation takes integral values, which makes the study of their congruence subgroups significant. In \cite{MR0938643}, Squier introduced a matrix representation of an Artin…
The induced action on the Picard group of a rational surface automorphism with positive entropy can be identified with an element of the Coxeter group associated to $E_n, n\ge 10$ diagram. It follows that the set of dynamical degrees of…
Let $C(T)$ be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either $B_n$ or $D_n$. Let $C_Y(T)$ be a natural quotient of $C(T)$, and if $C(T)$ is simply-laced (which means all the relations…
We enlarge a Coxeter group into a category, with one object for each finite parabolic subgroup, encoding the combinatorics of double cosets. This category, the singular Coxeter monoid, is connected to the geometry of partial flag varieties.…
In one of his papers on the weak order of Coxeter groups, Dyer formulates several conjectures. Among these, one affirms that the extended weak order forms a lattice, while another offers an algebraic-geometric description of the join of two…
The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in…
We study the group of type-preserving automorphisms of a right-angled building, in particular when the building is locally finite. Our aim is to characterize the proper open subgroups as the finite index closed subgroups of the stabilizers…
Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…
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…
In this article we classify the Coxeter systems for which the Brink-Howlett automaton is minimal. We show that this automaton is minimal if and only if each elementary root is supported on a standard spherical subsystem, thereby resolving a…
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…
In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…
We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a…
A traditional wavelet is a special case of a vector in a separable Hilbert space that generates a basis under the action of a system of unitary operators defined in terms of translation and dilation operations. A Coxeter/fractal-surface…
Braid groups may be defined for every Coxeter diagram. Artin's braid group is of type A. Analogs of Temperley-Lieb, Hecke and Birman-Wenzl algebras exist for B-type. Our general hypothethis is that the braid group of B-type replaces Artin's…
We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
We define the Coxeter cochain complex of a Coxeter group (G,S) with coefficients in a Z[G]-module A. This is closely related to the complex of simplicial cochains on the abstract simplicial complex I(S) of the commuting subsets of S. We…
In this paper we introduce the galaxy of Coxeter groups -- an infinite dimensional, locally finite, ranked simplicial complex which captures isomorphisms between Coxeter systems. In doing so, we would like to suggest a new framework to…
We introduce stable reflection length in Coxeter groups, as a way to study the asymptotic behaviour of reflection length. This creates connections to other well-studied stable length functions in groups, namely stable commutator length and…