The cycle enumerator of unimodal permutations
From MaRDI portal
Publication:1600828
DOI10.1007/s00026-001-8024-6zbMath0988.05092arXivmath/0102051OpenAlexW2034792060MaRDI QIDQ1600828
Publication date: 16 June 2002
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0102051
Related Items
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes, The parity of the number of permutation tableaux in a fixed shape, Analysis of casino shelf shuffling machines, Unimodal permutations and almost-increasing cycles, Enumerating two permutation classes by the number of cycles, Higher Lie characters and cyclic descent extension on conjugacy classes, Plethystic formulas for permutation enumeration, Arc permutations, An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations, The formal series Witt transform, Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems, Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
