Related papers: On reduced expressions for core double cosets

We consider the $[q+1,q-3,5]_q3$ generalized doubly-extended Reed-Solomon code of codimension $4$ as the code associated with the twisted cubic in the projective space $\mathrm{PG}(3,q)$. Basing on the point-plane incidence matrix of…

Let $W$ be a Coxeter group. We provide a precise description of the conjugacy classes in $W$, in the spirit of Matsumoto's theorem. This extends to all Coxeter groups an important result on finite Coxeter groups by M. Geck and G. Pfeiffer…

For infinite-dimensional groups $G\supset K$ the double cosets $K\setminus G/K$ quite often admit a structure of a semigroup; these semigroups act in $K$-fixed vectors of unitary representations of $G$. We show that such semigroups can be…

In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…

Let (\Pi,\Sigma) be a Coxeter system. An ordered list of elements in \Sigma and an element in \Pi determine a {\em subword complex}, as introduced in our paper on Gr\"obner geometry of Schubert polynomials (math.AG/0110058). Subword…

We show that for certain class of oligomorphic groups there is a version of multiplication of double cosets in the Ismagilov--Olshanski sense. Categories of (reduced) double cosets are realized as certain categories of partial bijections.…

As a visualization of Cartier and Foata's "partially commutative monoid" theory, G.X. Viennot introduced "heaps of pieces" in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models…

This paper is a sequel to work of Dynkin on subroot lattices of root lattices and to work of Carter on presentations of Weyl group elements as products of reflections. The quotients $L/L_1$ are calculated for all irreducible root lattices…

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Some relations between families of two-character CFTs are explained using a slightly generalised coset construction, and the underlying theories (whose existence was only conjectured based on the modular differential equation) are…

In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular…

A reduction formula for the branching coefficients of tensor products of representations and more generally restrictions of representations of a semisimple group to a semisimple subgroup is proved in work by Knutson-Tao and Derksen-Weyman.…

The aim of this note is to show that the cycle decomposition of elements of the symmetric group admits a quite natural formulation in the framework of dual Coxeter theory, yielding a generalization of it to the family of so-called parabolic…

Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…

Following Babai's algorithm for the string isomorphism problem, we determine that it is possible to write expressions of short length describing certain permutation cosets, including all permutation subgroups; this is feasible both in the…

In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

We study a type of generalized double coset operators which may change the characters of modular forms. For any pair of characters $v_1$ and $v_2$, we describe explicitly those operators mapping modular forms of character $v_1$ to those of…