The sets of flattened partitions with forbidden patterns

zbMath1455.05003arXiv2011.07304MaRDI QIDQ5144731

Fanja Rakotondrajao, Olivia Nabawanda

Publication date: 19 January 2021

Full work available at URL: https://arxiv.org/abs/2011.07304

zbMATH Keywords

Catalan numberinversionMotzkin numberpatternFibonacci numberflattened partitionrun

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

Peaks are preserved under run-sorting, Counting subword patterns in permutations arising as flattened partitions of sets

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On pattern avoiding flattened set partitions
• Patterns in permutations and words.
• Combinatorics of diagrams of permutations
• Pattern avoidance in ``flattened partitions
• Consecutive patterns in permutations
• Generalized permutation patterns and a classification of the Mahonian statistics
• The patterns of permutations
• Counting subwords in flattened partitions of sets
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Combinatorics of Set Partitions
• Run Distribution Over Flattened Partitions
• The Number of Partitions of a Set
• Recurrence relations for patterns of type (2,1) in flattened permutations
• Motzkin numbers
• Generalized pattern avoidance
• Permutations with restricted patterns and Dyck paths