Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.12513 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- For $0<q<1$, let $Maj$ be the distribution on the symmetric group $S_n$ such that a permutation $π\in S_n$ is selected with probability proportional to $q^{maj(π)}$. The distribution has connections to $q$-Plancherel measure. We describe an algorithm that realizes $Maj$, and use it to prove known results of $q$-Plancherel measure without the need of representation theory. This sampler is transparent and elegant, allowing properties of $Maj$ about its limit shape, pattern normality, and cycle structure to be obtained.