Geodesic
Pattern avoidance in alternating permutations and tableaux (extended abstract)
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) (2010).

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

We give bijective proofs of pattern-avoidance results for a class of permutations generalizing alternating permutations. The bijections employed include a modified form of the RSK insertion algorithm and recursive bijections based on generating trees. As special cases, we show that the sets $A_{2n}(1234)$ and $A_{2n}(2143)$ are in bijection with standard Young tableaux of shape $\langle 3^n \rangle$. Alternating permutations may be viewed as the reading words of standard Young tableaux of a certain skew shape. In the last section of the paper, we study pattern avoidance in the reading words of standard Young tableaux of any skew shape. We show bijectively that the number of standard Young tableaux of shape $\lambda / \mu$ whose reading words avoid $213$ is a natural $\mu$-analogue of the Catalan numbers. Similar results for the patterns $132$, $231$ and $312$. 
@article{DMTCS_2010_special_259_a75,
     author = {Lewis, Joel Brewster},
     title = {Pattern avoidance in alternating permutations and tableaux (extended abstract)},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)},
     year = {2010},
     doi = {10.46298/dmtcs.2880},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2880/}
}
TY  - JOUR
AU  - Lewis, Joel Brewster
TI  - Pattern avoidance in alternating permutations and tableaux (extended abstract)
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2880/
DO  - 10.46298/dmtcs.2880
LA  - en
ID  - DMTCS_2010_special_259_a75
ER  - 
%0 Journal Article
%A Lewis, Joel Brewster
%T Pattern avoidance in alternating permutations and tableaux (extended abstract)
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2880/
%R 10.46298/dmtcs.2880
%G en
%F DMTCS_2010_special_259_a75
Lewis, Joel Brewster. Pattern avoidance in alternating permutations and tableaux (extended abstract). Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) (2010). doi : 10.46298/dmtcs.2880. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2880/

Cité par Sources :