The cyclic structure of unimodal permutations

DOI10.1016/S0012-365X(00)00368-XMaRDI QIDQ5939922zbMATH OpenOpenAlexFDO

Authors 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

cycle structurepermutation

Mathematics Subject Classification ID

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

Abstract: Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a kind of combinatorial universality for continuous unimodal maps, by severely constraining the possible ways periodic orbits of any such map can nestle together. But our main observation (and tool) is the existence of a natural noncommutative monoidal structure on this class of permutations which respects their cyclic structure. This monoidal structure is a little mysterious, and can perhaps be understood by broadening the context, e.g. by looking for similar structure in other classes of `pattern-avoiding' permutations.

Review text

Any permutation can be decomposed into a product of disjoint cycles. This paper studies the cycle structure in the case when the permutations are unimodal.

Cited in

(12)

• 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
• Diameter of the commutation classes graph of a permutation
• Unimodal permutations and almost-increasing cycles
• Counting involutory, unimodal, and alternating signed permutations
• Analysis of casino shelf shuffling machines
• Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems
• Enumerating two permutation classes by the number of cycles
• The real teapot
• Pattern-restricted permutations of small order
• Enumerating alternating-runs with sign in type A and type B Coxeter groups

This page was built for publication: The cyclic structure of unimodal permutations

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