Counting permutations by the number of successions within cycles
From MaRDI portal
Publication:906485
DOI10.1016/J.DISC.2015.12.004zbMATH Open1329.05009OpenAlexW2197529788MaRDI QIDQ906485FDOQ906485
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Successions in words and compositions
- Set partitions with circular successions
- Permutations without 3-sequences
- Solution of the “Problème des ménages”
- Extended set partitions with successions
- Set partitions with restrictions
- Permutations by Number of Rises and Successions
- Successions in integer partitions
- Counting permutations by successions and other figures
- Permutations and successions
- Circular permutations by number of rises and successions
- Counting Successions in Permutations
- Permutations with interval cycles.
Cited In (11)
- Computing cardinalities of subsets on \(S_n\) with \(k\) adjacencies
- Counting permutations by simsun successions
- Alignments of permutations: their number, mean number, and total number of cycles
- Parity-alternating permutations and successions
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
- On the joint distributions of succession and Eulerian statistics
- Counting covered fixed points and covered arcs in an involution
- Enumeration of snakes and cycle-alternating permutations
- Fixed points and adjacent ascents for classical complex reflection groups
- Counting Multiple Cyclic Choices Without Adjacencies
- Counting subwords in flattened involutions and Kummer functions
Uses Software
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)
