Related papers: A refined count of Coxeter element factorizations
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)…
There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…
We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…
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…
For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…
In well-known work, Kazhdan and Lusztig (1979) defined a new set of Hecke algebra basis elements (actually two such sets) associated to elements in any Coxeter group. Often these basis elements are computed by a standard recursive algorithm…
We continue the study of extended Weyl groups $W$, which are reflection groups. Further we recall the definition of a hyperbolic cover of an extended Weyl group, and show that the hyperbolic covers of the extended Weyl groups are extended…
Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…
Fully commutative elements in types $B$ and $D$ are completely characterized and counted by Stembridge. Recently, Feinberg-Kim-Lee-Oh have extended the study of fully commutative elements from Coxeter groups to the complex setting, giving…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
We give an intrinsic criterion to tell whether a reflection factorization in the general linear group is reduced, and give a formula for computing reflection length in the general affine group.
In this paper, we consider representations of Coxeter groups over a path algebra, R, defined by Dyer. We answer a question posed by Dyer about the multiplicative properties of R, showing that it is "almost a domain". We also show that R cam…
Factorization theorems for single inclusive jet production play a crucial role in the study of jets and their substructure. In the case of small radius jets, the dynamics of the jet clustering can be factorized from both the hard production…
Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in…
We extend the class of factorization theorems for non-global observables from fixed angular constraints to cross sections defined in terms of sequential jet clustering. The associated hard and soft functions depend not only on the…
Let $W$ be a finite irreducible real reflection group, which is a Coxeter group. We explicitly construct a basis for the module of differential 1-forms with logarithmic poles along the Coxeter arrangement by using a primitive derivation. As…
In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative…
Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…
H.S.M. Coxeter showed that a group $\Gamma$ is a finite reflection group of an Euclidean space if and only if $\Gamma$ is a finite Coxeter group. In this paper, we define {\it reflections} of geodesic spaces in general, and we prove that…
For each positive integer $k$ we present an example of Coxeter system $(G_k,S_k)$ such that $G_k$ is a word-hyperbolic Coxeter group, for any two generating reflections $s,t\in S_k$ the product $st$ has finite order, and the Coxeter graph…