The random-to-top and the riffle shuffle are two well-studied methods for shuffling a deck of cards. These correspond to the symmetric group $S_n$, i.e., the Coxeter group of type $A_{n-1}$. In this paper, we give analogous shuffles for the Coxeter groups of type $B_n$ and $D_n$. These can be interpreted as shuffles on a ``signed'' deck of cards. With these examples as motivation, we abstract the notion of a shuffle algebra which captures the connection between the algebraic structure of the shuffles and the geometry of the Coxeter groups. We also briefly discuss the generalisation to buildings which leads to q-analogues.
Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $α\in R$, $v,w\in W$, we denote by $\partial_α$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew divided difference operators acting on the coinvariant algebra of $W$. Generalizing the work of Liu, we prove that $\partial_{w/v}$ can be written as a polynomial with nonnegative coefficients in $\partial_α$ where $α\in R^+$. In fact, we prove the stronger and analogous statement in the Nichols-Woronowicz algebra model for Schubert calculus on $W$ after Bazlov. We draw …
We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a representation. In the case when the weighted Coxeter graph is balanced we discuss how the generalized geometric representation is related to the numbers game played on the Coxeter graph.
Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for answering this question by constructing combinatorial objects that represent the inversion set and the reduced expressions for an arbitrary Coxeter group element. The framework also provides a formula for the length of an element formed by deleting a generator from a Coxeter group element. Fan and Hagiwara, et al$.$ showed that for certain Coxeter groups, the…
We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating permutations. We generalize these results to Coxeter groups. We also find a formula for the generating function for the characteristic polynomials of classical Coxeter groups, which is then related to affine Coxeter groups.
Special matchings are purely combinatorial objects associated with a partially ordered set, which have applications in Coxeter group theory. We provide an explicit characterization and a complete classification of all special matchings of any lower Bruhat interval. The results hold in any arbitrary Coxeter group and have also applications in the study of the corresponding parabolic Kazhdan--Lusztig polynomials.
Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erdös-Rényi model). In this paper, we extend this model to study random general Coxeter groups and give some results about random Coxeter groups, including some information about the homology of the nerve of a random Coxeter group and results about when random Coxeter groups are $δ$-hyperbolic and when they have the FC-type property.
We generalize some identities and q-identities previously known for the symmetric group to Coxeter groups of type B and D. The extended results include theorems of Foata and Schützenberger, Gessel, and Roselle on various distributions of inversion number, major index, and descent number. In order to show our results we provide caracterizations of the systems of minimal coset representatives of Coxeter groups of type B and D.
We show that for a parabolic quasi-Coxeter element in an affine Coxeter group the Hurwitz action on its set of reduced factorizations into a product of reflections is transitive. We call an element of the Coxeter group parabolic quasi-Coxeter element if it has a reduced factorization into a product of reflections that generate a parabolic subgroup.
We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to the second-highest 2-sided cell in the sense of Kazhdan-Lusztig. We also give a description of the cell representation provided by this 2-sided cell, and find out all its simple quotients for simply laced Coxeter system with no more than one circuit in the Coxeter graph.
Two new Elnitsky tilings for Coxeter groups of type $\mathrm{B}$ are displayed as certain subtilings. Additionally, a new tiling for the non-crystallographic Coxeter group of type $\mathrm{H}_3$ is obtained, described as a $\mathrm{D}_6$-subtiling.
We consider Lusztig's $\mathbf{a}$-function on Coxeter groups (in the equal parameter case) and classify all Coxeter groups with finitely many elements of $\mathbf{a}$-value 2 in terms of Coxeter diagrams.
For small $n$, the known compact hyperbolic $n$-orbifolds of minimal volume are intimately related to Coxeter groups of smallest rank. For $n=2$ and $3$, these Coxeter groups are given by the triangle group $[7,3]$ and the tetrahedral group $[3,5,3]$, and they are also distinguished by the fact that they have minimal growth rate among all cocompact hyperbolic Coxeter groups in $\hbox{Isom}\mathbb H^n$, respectively. In this work, we consider the cocompact Coxeter simplex group $G_4$ with Coxeter symbol $[5,3,3,3]$ in $\hbox{Isom}\mathbb H^4$ and the cocompact Coxeter prism group $G_5$ based on…
We continue the study of the maximally clustered elements for simply laced Coxeter groups which were recently introduced by Losonczy. Such elements include as a special case the freely braided elements of Losonczy and the author, which in turn constitute a superset of the $iji$-avoiding elements of Fan. Our main result is to classify the MC-finite Coxeter groups, namely those Coxeter groups having finitely many maximally clustered elements. Remarkably, any simply laced Coxeter group having finitely many $iji$-avoiding elements also turns out to be MC-finite.
A new class of positive definite functions related to colour-length function on arbitrary Coxeter group is introduced. Extensions of positive definite functions, called the Riesz-Coxeter product, from the Riesz product on the Rademacher (Abelian Coxeter) group to arbitrary Coxeter group is obtained. Applications to harmonic analysis, operator spaces and noncommutative probability is presented. Characterization of radial and colour-radial functions on dihedral groups and infinite permutation group are shown.
By the results of Cannon, Wagreich and Parry, it is known that the growth rate of a cocompact Coxeter group in 2-dimensional hyperbolic space $H^2$ and 3-dimensional hyperbolic space $H^3$ is a Salem number. Kerada defined a j-Salem number, which is a generalization of a Salem number. In this paper, we realize infinitely many 2-Salem numbers as the growth rates of cocompact Coxeter groups in 4-dimensional hyperbolic space $H ^4$. Our Coxeter polytopes are constructed by successive gluing of Coxeter polytopes which we call Coxeter dominoes.
We introduce in this paper the generalized virtual braid group on n strands GVB_n, generalizing simultaneously the braid groups and their virtual versions. A Mastumoto-Tits type section lifting shuffles in a symmetric group S_n to the monoid associated to GVB_n is constructed, which is then applied to characterize the quantum quasi-shuffle product. A family of representations of GVB_n is constructed using quantum groups.
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on an affine Coxeter group that naturally acts faithfully and cocompactly on $\R^n$ is bounded above by $2n$ and we also show that this bound is optimal. Conjecturally, spherical and affine Coxeter groups …
The objective of this paper is to detect which combinatorial properties of a regular graph can completely determine the geodesic growth of the right-angled Coxeter or Artin group this graph defines, and to provide the first examples of right-angled and even Coxeter groups with the same geodesic growth series.
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 sum identity which generalizes a well-known identity from the theory of Coxeter groups.
In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple formula that computes the reflection length of any element in any affine Coxeter group and we provide a simple uniform proof.
An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group W is cyclically fully commutative if any of its cyclic shifts remains fully commutative. These elements were studied in Boothby et al.. In particular the authors enumerated cyclically fully commutative elements in all Coxeter groups having a finite number of them. In this work we characterize and enumerate cyclically fully commutative elements according to their Coxeter length in all finite or aff…
Let $W$ be a finite Coxeter group. We classify the reflection subgroups of $W$ up to conjugacy and give necessary and sufficient conditions for the map that assigns to a reflection subgroup $R$ of $W$ the conjugacy class of its Coxeter elements to be injective, up to conjugacy.
We consider the notion of discrete Ricci curvature for graphs defined by Schmuckenschl{ä}ger \cite{shmuck} and compute its value for Bruhat graphs associated to finite Coxeter groups. To do so we work with the geometric realization of a finite Coxeter group and a classical result obtained by Dyer in \cite{Dyer}. As an application we obtain a bound for the spectral gap of the Bruhat graph of any finite Coxeter group and an isoperimetric inequality for them. Our proofs are case-free.
We define the notion of a climbing element in a finite real reflection group relative to a total order on the reflection set and we characterise these elements in the case where the total order arises from a bipartite Coxeter element.
We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of right-angled Coxeter groups. We use this characterization to describe a process for constructing candidate right-angled Coxeter presentations for a given group or proving that one cannot exist. We provide some first applications. In addition, we provide an elementary proof of rigidity of the defining graph for a right-angled Coxeter group. We also recover a resul…
We continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work (math.CO/0301104). A known upper bound for the number of commutation classes of reduced expressions for an element of a simply laced Coxeter group is shown to be achieved only when the element is freely braided; this establishes the converse direction of a previous result. It is also shown that a simply laced Coxeter group has finitely many freely braided elements if and only if it has finitely many fully commutative elements.
We show that the Hurwitz action is "as transitive as possible" on reflection factorizations of Coxeter elements in the well-generated complex reflection groups $G(d, 1, n)$ (the group of $d$-colored permutations) and $G(d, d, n)$.
We show that the characteristic series for the greedy normal form of a Coxeter group is always a rational series, and prove a reciprocity formula for this series when the group is right-angled and the nerve is Eulerian. As corollaries we obtain many of the known rationality and reciprocity results for the growth series of Coxeter groups as well as some new ones.
