Geodesic
On permutations avoiding partially ordered patterns defined by bipartite graphs
Sergey Kitaev1 ; Artem Pyatkin
1University of Strathclyde
The electronic journal of combinatorics, Tome 30 (2023) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative results for POPs in permutations defined by bipartite graphs, substantially extending the list of known results in this direction. In particular, we completely characterize the Wilf-equivalence for patterns defined by the N-shape posets.
DOI : 10.37236/11199
Classification : 05A05, 05A15
Mots-clés : partially ordered patterns, permutations, bipartite graphs

Sergey Kitaev  1   ; Artem Pyatkin 

1 University of Strathclyde 
@article{10_37236_11199,
     author = {Sergey Kitaev and Artem Pyatkin},
     title = {On permutations avoiding partially ordered patterns defined by bipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2023},
     volume = {30},
     number = {1},
     doi = {10.37236/11199},
     zbl = {1514.05007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/11199/}
}
TY  - JOUR
AU  - Sergey Kitaev
AU  - Artem Pyatkin
TI  - On permutations avoiding partially ordered patterns defined by bipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2023
VL  - 30
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/11199/
DO  - 10.37236/11199
ID  - 10_37236_11199
ER  - 
%0 Journal Article
%A Sergey Kitaev
%A Artem Pyatkin
%T On permutations avoiding partially ordered patterns defined by bipartite graphs
%J The electronic journal of combinatorics
%D 2023
%V 30
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/11199/
%R 10.37236/11199
%F 10_37236_11199
Sergey Kitaev; Artem Pyatkin. On permutations avoiding partially ordered patterns defined by bipartite graphs. The electronic journal of combinatorics, Tome 30 (2023) no. 1. doi: 10.37236/11199

Cité par Sources :