Counting permutations by the number of successions within cycles

DOI10.1016/J.DISC.2015.12.004MaRDI QIDQ906485zbMATHOpenAlexFDO

Authors Toufik Mansour, Mark Shattuck

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

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

Recommendations

• Adjacent \(q\)-cycles in permutations
• Parity-alternating permutations and successions
• Exact and limiting distributions of the number of successions in a random permutation
• Permutations with interval cycles.
• Publication:4489191

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Circular permutations by number of rises and successions
• Counting Successions in Permutations
• Counting permutations by successions and other figures
• Extended set partitions with successions
• Permutations and successions
• Permutations by Number of Rises and Successions
• Permutations with interval cycles.
• Permutations without 3-sequences
• Set partitions with circular successions
• Set partitions with restrictions
• Solution of the “Problème des ménages”
• Successions in integer partitions
• Successions in words and compositions

Cited in

(11)

• Enumeration of snakes and cycle-alternating permutations
• Counting Multiple Cyclic Choices Without Adjacencies
• Counting permutations by simsun successions
• Counting subwords in flattened involutions and Kummer functions
• Parity-alternating permutations and successions
• Computing cardinalities of subsets on \(S_n\) with \(k\) adjacencies
• Counting covered fixed points and covered arcs in an involution
• Alignments of permutations: their number, mean number, and total number of cycles
• Fixed points and adjacent ascents for classical complex reflection groups
• On the joint distributions of succession and Eulerian statistics
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

Describes a project that uses

Uses Software

• OEIS

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

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