Consecutive Pattern Containment and c-Wilf Equivalence
Combinatorics
2024-05-13 v4 Probability
Abstract
We offer elementary proofs for several results in consecutive pattern containment that were previously demonstrated using ideas from cluster method and analytical combinatorics. Furthermore, we establish new general bounds on the growth rates of consecutive pattern avoidance in permutations.
Cite
@article{arxiv.2304.14733,
title = {Consecutive Pattern Containment and c-Wilf Equivalence},
author = {Reza Rastegar},
journal= {arXiv preprint arXiv:2304.14733},
year = {2024}
}
Comments
One reference is added, and the introduction was modified to reflect a known result