2018
DOI: 10.1016/j.aam.2018.05.006
|View full text |Cite
|
Sign up to set email alerts
|

On (shape-)Wilf-equivalence for words

Abstract: Stankova and West showed that for any non-negative integer s and any permutation γ of {4, 5, . . . , s + 3} there are as many permutations that avoid 231γ as there are that avoid 312γ. We extend this result to the setting of words.2010 Mathematics Subject Classification. Primary 05A15; Secondary 05A17 05A19 05E10.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Of particular interest are the so-called transversal fillings, which contain exactly one 1-cell in each row and each column, and can be viewed as generalizations of permutation matrices. Transversal fillings of Ferrers shapes have played a crucial part in establishing most of the known results on Wilf equivalence [1,16], as well as in the study of many related combinatorial objects, such as involutions [2], words [7], matchings [9,12], graphs [5,6] or set partitions [4,11].…”
Section: Introductionmentioning
confidence: 99%
“…Of particular interest are the so-called transversal fillings, which contain exactly one 1-cell in each row and each column, and can be viewed as generalizations of permutation matrices. Transversal fillings of Ferrers shapes have played a crucial part in establishing most of the known results on Wilf equivalence [1,16], as well as in the study of many related combinatorial objects, such as involutions [2], words [7], matchings [9,12], graphs [5,6] or set partitions [4,11].…”
Section: Introductionmentioning
confidence: 99%