Avoiding colored partitions of two elements in the pattern sense

zbMATH Open1295.05049arXiv1203.3786MaRDI QIDQ5404236FDOQ5404236

Publication date: 24 March 2014

Abstract: Enumeration of pattern-avoiding objects is an active area of study with connections to such disparate regions of mathematics as Schubert varieties and stack-sortable sequences. Recent research in this area has brought attention to colored permutations and colored set partitions. A colored partition of a set

S

is a partition of

S

with each element receiving a color from the set

[k] = 1, 2, ..., k

. Let

P i_{n} w r C_{k}

be the set of partitions of

[n]

with colors from

[k]

. In an earlier work, the authors study pattern avoidance in colored set partitions in the equality sense. Here we study pattern avoidance in colored partitions in the pattern sense. We say that

s i g m a i n P i_{n} w r C_{k}

contains

p i i n P i_{m} w r C_{e} l l

in the pattern sense if

s i g m a

contains a copy

p i

when the colors are ignored and the colors on this copy of

p i

are order isomorphic to the colors on

p i

. Otherwise we say that

s i g m a

avoids

p i

. We focus on patterns from

P i_{2} w r C_{2}

and find that many familiar and some new integer sequences appear. We provide bijective proofs wherever possible, and we provide formulas for computing those sequences that are new.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

zbMATH Keywords

pattern avoidance colored set partition

Mathematics Subject Classification ID

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

Cited In (6)

Uses Software

OEIS

This page was built for publication: Avoiding colored partitions of two elements in the pattern sense

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