Pattern avoidance in forests of binary shrubs
Discrete mathematics & theoretical computer science, Permutation Patterns 2015, Tome 18 (2015-2016) no. 2.

Voir la notice de l'article provenant de la source Episciences

We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line $y=\ell x$, for some $\ell\in\mathbb{Q}^+$, one of these being the celebrated Duchon's club paths with $\ell=2/3$. In the remaining case, we use the machinery of analytic combinatorics to determine the minimal polynomial of its generating function, and deduce its growth rate.
@article{DMTCS_2016_18_2_a7,
     author = {Bevan, David and Levin, Derek and Nugent, Peter and Pantone, Jay and Pudwell, Lara and Riehl, Manda and Tlachac, ML},
     title = {Pattern avoidance in forests of binary shrubs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {18},
     number = {2},
     year = {2015-2016},
     doi = {10.46298/dmtcs.1322},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1322/}
}
TY  - JOUR
AU  - Bevan, David
AU  - Levin, Derek
AU  - Nugent, Peter
AU  - Pantone, Jay
AU  - Pudwell, Lara
AU  - Riehl, Manda
AU  - Tlachac, ML
TI  - Pattern avoidance in forests of binary shrubs
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 18
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1322/
DO  - 10.46298/dmtcs.1322
LA  - en
ID  - DMTCS_2016_18_2_a7
ER  - 
%0 Journal Article
%A Bevan, David
%A Levin, Derek
%A Nugent, Peter
%A Pantone, Jay
%A Pudwell, Lara
%A Riehl, Manda
%A Tlachac, ML
%T Pattern avoidance in forests of binary shrubs
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 18
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1322/
%R 10.46298/dmtcs.1322
%G en
%F DMTCS_2016_18_2_a7
Bevan, David; Levin, Derek; Nugent, Peter; Pantone, Jay; Pudwell, Lara; Riehl, Manda; Tlachac, ML. Pattern avoidance in forests of binary shrubs. Discrete mathematics & theoretical computer science, Permutation Patterns 2015, Tome 18 (2015-2016) no. 2. doi : 10.46298/dmtcs.1322. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1322/

Cité par Sources :