Run distribution over flattened partitions

MaRDI QIDQ5129995zbMATH OpenFDO

Authors Olivia Nabawanda, Fanja Rakotondrajao, Alex Samuel Bamunoba

Publication date 3 November 2020

Full work available at URL https://arxiv.org/abs/2007.03821, https://cs.uwaterloo.ca/journals/JIS/VOL23/Nabawanda/naba5.html

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

zbMATH Keywords

flattened partitiongenerating functionrecurrence relationrunset partition

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Abstract: The study of flattened partitions is an active area of current research. In this paper, our study unexpectedly leads us to the OEIS numbers A124324. We provide a new combinatorial interpretation of these numbers. A combinatorial bijection between flattened partitions over $[n+1]$ and the partitions of $[n]$ is also given in a separate section. We introduce the numbers $f_{n,k}$ which count the number of flattened partitions over $[n]$ having $k$ runs. We give recurrence relations defining them, as well as their exponential generating function in differential form. It should be appreciated if its closed form is established. We extend the results to flattened partitions where the first $s$ integers belong to different runs. Combinatorial proofs are given.

Recommendations

• The sets of flattened partitions with forbidden patterns
• Pattern avoidance in ``flattened partitions
• scientific article; zbMATH DE number 7732129
• On pattern avoiding flattened set partitions
• Counting subword patterns in permutations arising as flattened partitions of sets

Cites work

• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• A permutations representation that knows what ``Eulerian means
• An explicit formula for the number of permutations with a given number of alternating runs
• Combinatorics of set partitions
• Counting permutations by their alternating runs
• Counting subwords in flattened partitions of sets
• Enumeration of permutations by number of alternating runs
• Exceedingly deranging!
• scientific article; zbMATH DE number 1292563 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Pattern avoidance in ``flattened partitions
• Permutations with ascending and descending blocks
• The excedance set of a permutation
• The Number of Partitions of a Set

Cited in

(12)

• The runsort permuton
• Merging-free partitions and run-sorted permutations
• The sets of flattened partitions with forbidden patterns
• Counting subword patterns in permutations arising as flattened partitions of sets
• Peaks are preserved under run-sorting
• scientific article; zbMATH DE number 7732129 (Why is no real title available?)
• Peaks are preserved under run-sorting (extended abstract)
• A new formula for the determinant and bounds on its tensor and Waring ranks
• Flattened Stirling permutations
• Pattern avoidance in flattened derangements
• Triangular flattened partitions
• Enumeration of consecutive patterns in flattened Catalan words

Describes a project that uses

Uses Software

• OEIS
• Mathematica

This page was built for publication: Run distribution over flattened partitions

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