On pattern-avoiding partitions

2007/03/29 by Jelinek, Vit, Mansour, Toufik · 1 citation
#05A15 #05A17 #05A18 #05A19 #05E10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.math/0703898

Abstract

A set partition of the set [n]=\1,...c,n\ is a collection of disjoint blocks B₁,B₂,...c, B_d whose union is [n]. We choose the ordering of the blocks so that they satisfy min B₁

Cited by

• The insertion encoding of restricted growth functions

Related

• Pattern avoidance in ordered set partitions and words
• Pattern Avoidance in Set Partitions
• Pattern Avoidance in Ordered Set Partitions
• Pattern avoidance in "flattened" partitions
• Avoidance of Partitions of a Three-element Set