On an open problem of Green and Losonczy: exact enumeration of freely braided permutations
Recently, Green and Losonczy~GL1,GL2 introduced \emphfreely braided permutation as a special class of restricted permutations has arisen in representation theory. The freely braided permutations were introduced and studied as the upper bound for the number of commutation classes of reduced expressio...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2004-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/327/pdf |