Cyclic permutations: degrees and combinatorial types
From MaRDI portal
Publication:2049453
DOI10.1016/j.jcta.2021.105518zbMath1471.05004arXiv1909.03300OpenAlexW3196033648MaRDI QIDQ2049453
Publication date: 25 August 2021
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03300
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Combinatorial probability (60C05) Factorization (11Y05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine descents and the Steinberg torus
- Lie elements in the tensor algebra
- The distribution of descents in fixed conjugacy classes of the symmetric groups
- Counting permutations with given cycle structure and descent set
- Probabilistic bounds on the coefficients of polynomials with only real zeros
- Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
- Riffle shuffles, cycles, and descents
- A general commutative descent algebra
- Dynamics on the unit disk: short geodesics and simple cycles
- Central limit theorem for descents in conjugacy classes of \(S_n\)
- Central limit theorem for peaks of a random permutation in a fixed conjugacy class of \(S_n\)
- A central limit theorem for descents and major indices in fixed conjugacy classes of \(S_n\)
- On combinatorial types of periodic orbits of the map \(x \mapsto kx \pmod{\mathbb{Z}} \)
- Central and local limit theorems applied to asymptotic enumeration
- Cyclic descents and \(P\)-partitions.
- Eulerian Numbers
- Stirling Behavior is Asymptotically Normal
This page was built for publication: Cyclic permutations: degrees and combinatorial types
