English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Pattern avoidance in the symmetric group $S_n$ has provided a number ofuseful connections between seemingly unrelated problems from stack-sorting toSchubert varieties. Recent work has generalized these results to $S_n\wr C_c$,the objects of which can be viewed as "colored permutations".  Another body of research that has grown from the study of pattern avoidancein permutations is pattern avoidance in $\Pi_n$, the set of set partitions of$[n]$. Pattern avoidance in set partitions is a generalization of thewell-studied notion of noncrossing partitions.  Motivated by recent results in pattern avoidance in $S_n \wr C_c$ we providea catalog of initial results for pattern avoidance in colored partitions,$\Pi_n \wr C_c$. We note that colored set partitions are not a completely newconcept. \emph{Signed} (2-colored) set partitions appear in the work ofBj\"{o}rner and Wachs involving the homology of partition lattices. However, weseek to study these objects in a new enumerative context.

Avoiding Colored Partitions of Lengths Two and Three