Permutation reconstruction from a few large patterns
The electronic journal of combinatorics, Tome 28 (2021) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Every permutation of rank $n \geqslant 5$ is reconstructible from any $\lceil n / 2 \rceil + 2$ of its $(n-1)$-patterns.
DOI : 10.37236/10403
Classification : 05A05
Mots-clés : permutation patterns

Maria João Gouveia  1   ; Erkko Lehtonen  2

1 Universidade de Lisboa
2 Technische Universität Dresden
@article{10_37236_10403,
     author = {Maria Jo\~ao Gouveia and Erkko Lehtonen},
     title = {Permutation reconstruction from a few large patterns},
     journal = {The electronic journal of combinatorics},
     year = {2021},
     volume = {28},
     number = {3},
     doi = {10.37236/10403},
     zbl = {1473.05010},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10403/}
}
TY  - JOUR
AU  - Maria João Gouveia
AU  - Erkko Lehtonen
TI  - Permutation reconstruction from a few large patterns
JO  - The electronic journal of combinatorics
PY  - 2021
VL  - 28
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10403/
DO  - 10.37236/10403
ID  - 10_37236_10403
ER  - 
%0 Journal Article
%A Maria João Gouveia
%A Erkko Lehtonen
%T Permutation reconstruction from a few large patterns
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/10403/
%R 10.37236/10403
%F 10_37236_10403
Maria João Gouveia; Erkko Lehtonen. Permutation reconstruction from a few large patterns. The electronic journal of combinatorics, Tome 28 (2021) no. 3. doi: 10.37236/10403

Cité par Sources :