Is there any recurrence relation known for the number of reduced words of the longest element in $S_n$ (not commutation classes)?
Recurrence relation for number of reduced words of longest element in $S_n$
Bipolar Minds
- 1.8k
- 10
- 16