All Questions
10 questions
5
votes
1
answer
212
views
What is the effect of tensoring with the sign representation on irreducible modules for a Type D Weyl group?
Given an integer $n \geq 4$, consider the Weyl groups $W(B_n)$ and $W(D_n)$ of types $B_n$ and $D_n$, respectively, and consider their representation theory over the field of complex numbers.
The Weyl ...
- 3,054
2
votes
1
answer
145
views
When are these irreducible complex representations for the Type D Weyl group self-dual?
Given an integer $n \geq 4$, consider the Weyl groups $W(B_n)$ and $W(D_n)$ of types $B_n$ and $D_n$, respectively, and consider their representation theory over the field of complex numbers.
The Weyl ...
- 44.4k
8
votes
2
answers
282
views
One element commutation classes of reduced decompositions of the longest element of the Weyl group
For the symmetric group on $n$ objects $S_n$ the question of how to write its longest element $w_0$ as a reduced decomposition is an important combinatorical problem. As example, in this question the ...
2
votes
1
answer
257
views
Recurrence relation for number of reduced words of longest element in $S_n$
Is there any recurrence relation known for the number of reduced words of the longest element in $S_n$ (not commutation classes)?
Edit: Sorry for unaccepting the answer, but I realized that I really ...
- 2,168
1
vote
0
answers
176
views
Relation between groups $A_n$, $B_n$, $D_n$ and $S_n$ or inversions of random elements in Coxeter groups
First of of all I'm trying to find a general interpretation to the following facts below.
Let's look at the property of Kendall-Mann numbers $M(n)$ which are row maxima of Triangle of Mahonian ...
1
vote
0
answers
130
views
Word length norm in the symmetric group $\mathfrak{S}_r$
Consider on the symmetric group $\mathfrak{S}_r$ the generating system $\{\tau_i;\,1\le i\le r-1\}$ with $\tau_i = \langle i,i+1\rangle$ and the corresponding word length norm $N$. Now let $\tau\in\...
- 63.9k
1
vote
2
answers
259
views
A question about set of inversion
Let $w \in S_n$ and $inv(w) = \{(i,j): i,j \in \{1,\ldots,n\}, i<j, w(i)>w(j)\}$ the inversion set of $w$. Let ${\bf i}=(i_1,\ldots,i_m)$ be a sequence such that $s_{i_1}\cdots s_{i_m}$ is a ...
- 6,201
6
votes
1
answer
301
views
Reference request: Reduced reflection length in Coxeter groups
I recently read this paper, where the authors define on page 26 what they call the reduced reflection length. For that we take a Coxeter group $G$ with Coxeter generators $S$ and transpositions $T$. ...
- 63.9k
0
votes
1
answer
232
views
Number of Boolean algebra subintervals in weak order of $S_n$
I'm wondering if anybody has an easy way to compute the number of subintervals in weak order of $S_n$ (considered as a Coxeter group of type $A_{n-1}$) that are isomorphic to Boolean algebras. I know $...
- 50.8k
11
votes
2
answers
2k
views
Algorithm for reducing words in a Coxeter group
Let $W$ be a Coxeter group with set of simple reflections $S$. Suppose that I have chosen a preferred reduced decomposition for every element of $W$. Given an arbitrary word in the alphabet $S$, is ...
- 3,532