New refined enumerations of set partitions related to sorting
DOI10.1080/10236198.2018.1511711zbMATH Open1402.05013OpenAlexW2889220044WikidataQ129336355 ScholiaQ129336355MaRDI QIDQ4559339FDOQ4559339
Authors: Toufik Mansour, Mark Shattuck 
Publication date: 3 December 2018
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236198.2018.1511711
Recommendations
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Bell and Stirling numbers (11B73)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- On \(abab\)-free and \(abba\)-free set partitions
- Title not available (Why is that?)
- Combinatorics of set partitions
- Records in set partitions
- Generalized Stirling and Lah numbers
- Title not available (Why is that?)
- \(p,q\)-Stirling numbers and set partition statistics
- Combinatorial statistics on non-crossing partitions
- Levels in bargraphs
- Combinatorial parameters in bargraphs
- Some set partition statistics in non-crossing partitions and generating functions
- Kernel method and linear recurrence system
Cited In (7)
- Merging-free partitions and run-sorted permutations
- Interpolating set partition statistics
- Title not available (Why is that?)
- A simple sorting algorithm for compositions
- Counting set partitions by the number of movable letters
- Pushes in words -- a primitive sorting algorithm
- Counting partitions by genus: a compendium of results
Uses Software
This page was built for publication: New refined enumerations of set partitions related to sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559339)
