All Questions
15 questions
12
votes
1
answer
385
views
Question on a reduction in Kirillov's paper on positivity of divided difference operators
As the title says, my question is on a specific argument in Kirillov - Skew divided difference operators and Schubert polynomials (journal, MSN) on positivity of divided difference operators. I recall ...
- 1,066
10
votes
4
answers
940
views
Is there a non-explicit characterization of the Specht modules?
It is a basic fact about the symmetric group $S_n$ that its irreducible representations are indexed by partitions of $n$.
My question is, can the association between partitions and irreps be ...
- 258
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 ...
8
votes
1
answer
203
views
Reference request: Coxeter length and irreducible characters
Let $S_n$ be the symmetric group on $\{1,2,\ldots, n\}$ and $\ell$ the Coxeter length on $S_n$. There is a well-known formula to compute this length, namely for a $\pi \in S_n$ we have
$$\ell(\pi) = |\...
- 809
7
votes
1
answer
591
views
Can Matsumoto's theorem for the symmetric group be proved using a monovariant?
This is a question that can be asked for any Coxeter group, but for the sake of simplicity I will restrict myself to symmetric groups. Recall the main definitions:
Let $n$ be a nonnegative integer. ...
- 33.8k
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$. ...
- 809
4
votes
1
answer
296
views
Number of paths in the Bruhat order in the symmetric group
Let $\mathbb{S}_m$ the symmetric group on $m$ letters. Let $v\in\mathbb{S}_m$, and consider paths in the Bruhat order like this: $1\lessdot v_1\lessdot\cdots\lessdot v$, where $\lessdot$ means the ...
- 1,066
4
votes
0
answers
145
views
Words that give rise to an enumeration of elements of the symmetric group
Let $\mathbb{S}_m$ be the symmetric group on $m$ letters. Let $n=m-1$. Let $\mathbf{w}=a_1\cdots a_r$ be a word on the alphabet $\{1,\ldots,n\}$. We say that $\mathbf{w}$ gives rise to an enumeration ...
- 1,066
4
votes
0
answers
98
views
Ref. request: Enumerating elements of Bruhat cells
Given a field $F$ and a natural number $n$, let $B$ be the group of lower triangular, invertible $n \times n$ matrices over $F$. Then
$$GL_n(F) = \biguplus_{\pi \in S_n} B \pi B,$$
where we embed the ...
- 809
2
votes
0
answers
81
views
Characterization of permutations which have at most one successor in the covering relation of the weak Bruhat order
Let $W$ be the symmetric group on $n+1$ letters. Let $\ell$ be the length function on $W$.
As the title says, can we characterize all $v\in W$ such that there exists a $w\in W$ such that for all ...
- 1,066
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
1
vote
1
answer
113
views
Minimal dominant permutation in weak order
Consider $S_\infty$ as a Coxeter group with Coxeter generators the adjacent transpositions $s_i$, $i\geq 1$. We view elements of $S_\infty$ as functions $u:\mathbb{N}\to\mathbb{N}$. Recall the Lehmer ...
- 2,168
1
vote
0
answers
147
views
A certain kind of permutations and transport of Bruhat chains under conjugation
Let $(W,S)$ be a finite Coxeter system. Let us consider the following situation:
Let $v_1,v_2,w\in W$ such that $v_1=wv_2w^{-1}$. Let $s_{\beta_r}\ldots s_{\beta_1}$ be a reduced expression of $v_2$. ...
- 1,066
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 ...
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 $...
- 2,168