Pattern-avoiding modified ascent sequences
The electronic journal of combinatorics, Tome 32 (2025) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations avoiding a bivincular pattern of length three. We enumerate some patterns via bijections with other combinatorial structures such as Fishburn permutations, lattice paths and set partitions. We settle the last remaining case of a conjecture by Duncan and Steingrímsson by proving that modified ascent sequences avoiding 2321 are counted by the Bell numbers.
DOI : 10.37236/12722
Classification : 05A05, 05A19, 11B83
Mots-clés : Stanley's standardization, transport theorem

Giulio Cerbai  1

1 University of Iceland
@article{10_37236_12722,
     author = {Giulio Cerbai},
     title = {Pattern-avoiding modified ascent sequences},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {3},
     doi = {10.37236/12722},
     zbl = {8097634},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12722/}
}
TY  - JOUR
AU  - Giulio Cerbai
TI  - Pattern-avoiding modified ascent sequences
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12722/
DO  - 10.37236/12722
ID  - 10_37236_12722
ER  - 
%0 Journal Article
%A Giulio Cerbai
%T Pattern-avoiding modified ascent sequences
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/12722/
%R 10.37236/12722
%F 10_37236_12722
Giulio Cerbai. Pattern-avoiding modified ascent sequences. The electronic journal of combinatorics, Tome 32 (2025) no. 3. doi: 10.37236/12722

Cité par Sources :