Longest increasing subsequences of random colored permutations.
The Electronic Journal of Combinatorics [electronic only] (1999)
- Volume: 6, Issue: 1, page Research paper R13, 12 p.-Research paper R13, 12 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBorodin, Alexei. "Longest increasing subsequences of random colored permutations.." The Electronic Journal of Combinatorics [electronic only] 6.1 (1999): Research paper R13, 12 p.-Research paper R13, 12 p.. <http://eudml.org/doc/119960>.
@article{Borodin1999,
author = {Borodin, Alexei},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {random permutation; increasing subsequence; limit distribution},
language = {eng},
number = {1},
pages = {Research paper R13, 12 p.-Research paper R13, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Longest increasing subsequences of random colored permutations.},
url = {http://eudml.org/doc/119960},
volume = {6},
year = {1999},
}
TY - JOUR
AU - Borodin, Alexei
TI - Longest increasing subsequences of random colored permutations.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1999
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 6
IS - 1
SP - Research paper R13, 12 p.
EP - Research paper R13, 12 p.
LA - eng
KW - random permutation; increasing subsequence; limit distribution
UR - http://eudml.org/doc/119960
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.