Geodesic
On the longest \(k\)-alternating subsequence
Igor Pak1 ; Robin Pemantle2
1University of California at Los Angeles
2University of Pennsylvania
The electronic journal of combinatorics, Tome 22 (2015) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We show that the longest $k$-alternating substring of a random permutation has length asymptotic to $2(n-k)/3$.
DOI : 10.37236/4480
Classification : 05A16

Igor Pak  1   ; Robin Pemantle  2

1 University of California at Los Angeles
2 University of Pennsylvania 
@article{10_37236_4480,
     author = {Igor Pak and Robin Pemantle},
     title = {On the longest \(k\)-alternating subsequence},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {1},
     doi = {10.37236/4480},
     zbl = {1308.05013},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4480/}
}
TY  - JOUR
AU  - Igor Pak
AU  - Robin Pemantle
TI  - On the longest \(k\)-alternating subsequence
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4480/
DO  - 10.37236/4480
ID  - 10_37236_4480
ER  - 
%0 Journal Article
%A Igor Pak
%A Robin Pemantle
%T On the longest \(k\)-alternating subsequence
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/4480/
%R 10.37236/4480
%F 10_37236_4480
Igor Pak; Robin Pemantle. On the longest \(k\)-alternating subsequence. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/4480

Cité par Sources :