2,901 research outputs found
Pattern avoidance for set partitions \`a la Klazar
In 2000 Klazar introduced a new notion of pattern avoidance in the context of
set partitions of . The purpose of the present paper is to
undertake a study of the concept of Wilf-equivalence based on Klazar's notion.
We determine all Wilf-equivalences for partitions with exactly two blocks, one
of which is a singleton block, and we conjecture that, for , these are
all the Wilf-equivalences except for those arising from complementation. If
is a partition of and denotes the set of all
partitions of that avoid , we establish inequalities between
and for several choices of and
, and we prove that if is the partition of with only one
block, then and all partitions
of with exactly two blocks. We conjecture that this result holds
for all partitions of . Finally, we enumerate for
all partitions of .Comment: 21 page
Two Vignettes On Full Rook Placements
Using bijections between pattern-avoiding permutations and certain full rook
placements on Ferrers boards, we give short proofs of two enumerative results.
The first is a simplified enumeration of the 3124, 1234-avoiding permutations,
obtained recently by Callan via a complicated decomposition. The second is a
streamlined bijection between 1342-avoiding permutations and permutations which
can be sorted by two increasing stacks in series, originally due to Atkinson,
Murphy, and Ru\v{s}kuc.Comment: 9 pages, 4 figure
Egge triples and unbalanced Wilf-equivalence
Egge conjectured that permutations avoiding the set of patterns
, where ,
are enumerated by the large Schr\"oder numbers. Consequently,
with as above is Wilf-equivalent to the set of
patterns . Burstein and Pantone proved the case of
. We prove the remaining four cases. As a byproduct of our proof,
we also enumerate the case .Comment: 20 pages, 6 figures (published version
- β¦