Patterns in words of ordered set partitions

DOI10.4310/JOC.2019.V10.N3.A2MaRDI QIDQ2416926zbMATH OpenWikidataFDO

Authors Dun Qiu, Jeffrey Remmel

Publication date 24 May 2019

Published in Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

bijectionsDyck pathsordered set partitionspattern avoidancepermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)

Abstract: An ordered set partition of $1,2,ldots,n$ is a partition with an ordering on the parts. Let $mathcal{OP}_{n,k}$ be the set of ordered set partitions of $[n]$ with $k$ blocks. Godbole, Goyt, Herdan and Pudwell defined $mathcal{OP}_{n,k}(sigma)$ to be the set of ordered set partitions in $mathcal{OP}_{n,k}$ avoiding a permutation pattern $sigma$ and obtained the formula for $|mathcal{OP}_{n,k}(sigma)|$ when the pattern $sigma$ is of length $2$. Later, Chen, Dai and Zhou found a formula algebraically for $|mathcal{OP}_{n,k}(sigma)|$ when the pattern $sigma$ is of length $3$. In this paper, we define a new pattern avoidance for the set $mathcal{OP}_{n,k}$, called $mathcal{WOP}_{n,k}(sigma)$, which includes the questions proposed by Godbole, Goyt, Herdan and Pudwell. We obtain formulas for $|mathcal{WOP}_{n,k}(sigma)|$ combinatorially for any $sigma$ of length $3$. We also define 3 kinds of descent statistics on ordered set partitions and study the distribution of the descent statistics on $mathcal{WOP}_{n,k}(sigma)$ for $sigma$ of length $3$.

Recommendations

• Pattern avoidance in ordered set partitions and words
• Partially ordered generalized patterns and k-ary words
• Pattern avoidance in ordered set partitions
• Counting Ordered Patterns in Words Generated by Morphisms
• Counting ordered patterns in words generated by morphisms
• On universal partial words for word-patterns and set partitions
• Partially ordered patterns and their combinatorial interpretations
• Bipartition orders and statistics on words
• ON PARTITIONS SEPARATING WORDS
• Words coding set partitions

Cited in

(9)

• Partially ordered generalized patterns and k-ary words
• Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)
• Pattern avoidance in ordered set partitions and words
• Ordered partitions avoiding a permutation pattern of length 3
• ON PARTITIONS SEPARATING WORDS
• Pattern avoidance in ordered set partitions
• The multivariate Lah and Stirling numbers
• Pattern avoidance in parking functions
• Results on pattern avoidance in parking functions

This page was built for publication: Patterns in words of ordered set partitions

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