Related papers: Cone Types, Automata, and Regular Partitions in Co…

Let W~ be an affine Weyl group, and let C be a left, right, or two-sided Kazhdan--Lusztig cell in W~. Let Reduced (C) be the set of all reduced expressions of elements of C, regarded as a formal language in the sense of the theory of…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

The notion of a linear Coxeter system introduced by Vinberg generalizes the geometric representation of a Coxeter group. Our main theorem asserts that if $v$ is an element of the Tits cone of a linear Coxeter system and $\cW$ is the…

We apply the techniques of symmetric generation to establish the standard presentations of the finite simply laced irreducible finite Coxeter groups, that is the Coxeter groups of types An, Dn and En, and show that these are naturally…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

We define a generalization of Coxeter graphs and an associated Coxeter system and Coxeter mapping class. These can be used to construct periodic Coxeter mapping classes on surfaces with arbitrarily large genus, preserving lots of…

We prove a number of results about profinite completions of Coxeter groups. For example we prove Coxeter groups are good in the sense of Serre and that various splittings of Coxeter groups arising from actions on trees are detected by the…

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

In this short, elementary note we prove that if a faithful reflection representation of a Coxeter group preserves an orthant, then that Coxeter group is a product of symmetric groups acting on its natural permutation representation. We also…

The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…

Coxeter groups are a special class of groups generated by involutions. They play important roles in the various areas of mathematics. This survey particularly focuses on how one uses Coxeter groups to construct interesting examples of…

We study the diameter of the graph $G(w)$ of reduced words of an element $w$ in a Coxeter group $W$ whose edges correspond to applications of the Coxeter relations. We resolve conjectures of Reiner--Roichman and Dahlberg--Kim by proving a…

We define ``star reducible'' Coxeter groups to be those Coxeter groups for which every fully commutative element (in the sense of Stembridge) is equivalent to a product of commuting generators by a sequence of length-decreasing star…

Let W be an infinite Coxeter group. We initiate the study of the set E of limit points of "normalized" positive roots (representing the directions of the roots) of W. We show that E is contained in the isotropic cone of the bilinear form B…

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…

We construct complex root spaces remaining invariant under antilinear involutions related to all Coxeter groups. We provide two alternative constructions: One is based on deformations of factors of the Coxeter element and the other based on…

A common feature of Coxeter groups and right-angled Artin groups is their solution to the word problem. Matthew Dyer introduced a class of groups, which we call Dyer groups, sharing this feature. This class includes, but is not limited to,…

We define in an axiomatic fashion a \emph{Coxeter datum} for an arbitrary Coxeter group $W$. This Coxeter datum will specify a pair of reflection representations of $W$ in two vector spaces linked only by a bilinear paring without any…

Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements.…