The cyclic structure of unimodal permutations

DOI10.1016/S0012-365X(00)00368-XzbMath0983.05005arXivmath/9906207OpenAlexW2037974267MaRDI QIDQ5939922

Terry Gannon

Publication date: 21 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9906207

zbMATH Keywords

permutationcycle structure

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

Diameter of the commutation classes graph of a permutation, 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, An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations, Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems, Counting involutory, unimodal, and alternating signed permutations, Applications of symmetric functions to cycle and increasing subsequence structure after shuffles