Permutations with ascending and descending blocks

MaRDI QIDQ2380446zbMATH OpenFDO

Authors Jacob Steinhardt

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0908.4347, https://eudml.org/doc/226520, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r14.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then provide the first bijective proofs of some known results. We also solve some problems posed in [3] by Eriksen, Freij, and Wastlund, who study derangements that descend in blocks of prescribed lengths.

Review text

Summary: We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of \textit{I. M. Gessel} and \textit{C. Reutenauer} [J. Comb. Theory, Ser. A 64, No. 2, 189--215 (1993; Zbl 0793.05004)] to deal with permutations that have some ascending and some descending blocks. We then provide the first bijective proofs of some known results. We also extend the work done in [Electron. J. Comb. 16, No. 1, Research Paper R32, 19 p. (2009; Zbl 1181.05003)] by \textit{N. Eriksen}, \textit{R. Freij} and \textit{J. Wästlund}, who study derangements that descend in blocks of prescribed lengths. In particular, we solve some problems posed in [loc. cit.] and also obtain a new combinatorial sum for counting derangements with ascending and descending blocks.

Recommendations

• Sorting permutations by block-interchanges
• Stacking Blocks and Counting Permutations
• scientific article; zbMATH DE number 4031700
• Permutations on the block PRAM
• Block patterns in Stirling permutations
• Permutations
• scientific article; zbMATH DE number 1943960
• Counting permutations by alternating descents
• Generating permutations with given ups and downs

Cited in

(11)

• Descent classes of permutations with a given number of fixed points
• Plethystic formulas for permutation enumeration
• Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• Descents of derangements and circular words
• Stacking Blocks and Counting Permutations
• scientific article; zbMATH DE number 4031700 (Why is no real title available?)
• Run distribution over flattened partitions
• scientific article; zbMATH DE number 7732129 (Why is no real title available?)
• A bijection for descent sets of permutations with only even and only odd cycles
• The cycle descent statistic on permutations

Describes a project that uses

Uses Software

• BijTools
• Examples
• Fibonacci
• TransMethodZeck
• ZeckFibBijections

This page was built for publication: Permutations with ascending and descending blocks

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