Related papers: Visual Decompositions of Coxeter Groups

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…

The following results are proved: The center of any finite index subgroup of an irreducible, infinite, non-affine Coxeter group is trivial; Any finite index subgroup of an irreducible, infinite, non-affine Coxeter group cannot be expressed…

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…

We define and study cocycles on a Coxeter group in each degree generalizing the sign function. When the Coxeter group is a Weyl group, we explain how the degree three cocycle arises naturally from geometry representation theory.

The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Existing research gives conditions for when the outer automorphism group of a graph product of primary cyclic groups $W_\Gamma$ is finite, virtually abelian, or large. We seek to prove a set of conditions for when this outer automorphism…

We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the…

In this paper, we use combinatorial group theory and a limiting process to connect various types of hypergeometric series, and of relations among such series. We begin with a set $S$ of 56 distinct translates of a certain function $M$,…

For a finite Coxeter group W, a subword complex is a simplicial complex associated with a pair (Q, \rho), where Q is a word in the alphabet of simple reflections, \rho is a group element. We describe the transformations of such a complex…

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

In this short note we discuss the interplay between finite Coxeter groups and construction of wavelet sets, generalized multiresolution analysis and sampling.

Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…

Let W be a finite Coxeter group. We define its Hecke-group algebra by gluing together appropriately its group algebra and its 0-Hecke algebra. We describe in detail this algebra (dimension, several bases, conjectural presentation,…

This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are…

For W a finite Coxeter group, a formula is found for the size of W equivalence classes of subsets of a base. The proof is a case-by-case analysis using results and tables of Carter and Orlik/Solomon. As a corollary we obtain an alternating…

Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…

We review the properties of the finite Coxeter groups which are most useful for applications to cohomological invariants, namely their classes of involutions and their "cubes" (abelian subgroups generated by reflections).