Counting subword patterns in permutations arising as flattened partitions of sets

DOI10.2298/AADM210223009MzbMath1499.05043OpenAlexW4226350714MaRDI QIDQ5866251

Toufik Mansour, Mark Shattuck

Publication date: 13 June 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm210223009m

zbMATH Keywords

kernel methodpattern avoidanceflattened partitionsubwordcombinatorial statistic

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Uses Software

• Mathematica
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(r\)-Whitney numbers of Dowling lattices
• Set partition asymptotics and a conjecture of Gould and Quaintance
• A generalization of the \(r\)-Whitney numbers of the second kind
• A new formula for the Bernoulli polynomials
• Patterns in permutations and words.
• The \(r\)-Stirling numbers
• Pattern avoidance in ``flattened partitions
• q-Catalan numbers
• On Whitney numbers of Dowling lattices
• On some numbers related to Whitney numbers of Dowling lattices
• Engel's inequality for Bell numbers
• Counting subwords in flattened partitions of sets
• Kernel method and linear recurrence system
• The $r$-Bell numbers
• Combinatorics of Set Partitions
• Run Distribution Over Flattened Partitions
• The sets of flattened partitions with forbidden patterns
• Combinatorics of Compositions and Words

This page was built for publication: Counting subword patterns in permutations arising as flattened partitions of sets