The cycle enumerator of unimodal permutations

DOI10.1007/S00026-001-8024-6MaRDI QIDQ1600828zbMATH OpenOpenAlexFDO

Authors Jean-Yves Thibon

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

zbMATH Keywords

cycle indexunimodal permutations

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Abstract: We give a generating function for the number of unimodal permutations with a given cycle structure.

Cited in

(13)

• Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
• The parity of the number of permutation tableaux in a fixed shape
• Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
• An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
• Plethystic formulas for permutation enumeration
• Arc permutations
• Unimodal permutations and almost-increasing cycles
• Analysis of casino shelf shuffling machines
• The formal series Witt transform
• Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems
• Enumerating two permutation classes by the number of cycles
• Higher Lie characters and cyclic descent extension on conjugacy classes
• Pattern-restricted permutations of small order

This page was built for publication: The cycle enumerator of unimodal permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600828)