Counting permutations by the number of successions within cycles

DOI10.1016/j.disc.2015.12.004zbMath1329.05009OpenAlexW2197529788MaRDI QIDQ906485

Mark Shattuck, Toufik Mansour

Publication date: 21 January 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.004

zbMATH Keywords

permutationcombinatorial proofStirling number of first kindsuccession

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Permutations, words, matrices (05A05)

Related Items (4)

Counting covered fixed points and covered arcs in an involution ⋮ Counting permutations by simsun successions ⋮ Counting subwords in flattened involutions and Kummer functions ⋮ Fixed points and adjacent ascents for classical complex reflection groups

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set partitions with circular successions
• Extended set partitions with successions
• Set partitions with restrictions
• Successions in integer partitions
• Counting permutations by successions and other figures
• Permutations and successions
• Circular permutations by number of rises and successions
• Successions in words and compositions
• Counting Successions in Permutations
• Permutations by Number of Rises and Successions
• Permutations without 3-sequences
• Solution of the “Problème des ménages”

This page was built for publication: Counting permutations by the number of successions within cycles