Permutations without long decreasing subsequences and random matrices.
The Electronic Journal of Combinatorics [electronic only] (2007)
- Volume: 14, Issue: 1, page Research paper R11, 9 p.-Research paper R11, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topŚniady, Piotr. "Permutations without long decreasing subsequences and random matrices.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research paper R11, 9 p.-Research paper R11, 9 p.. <http://eudml.org/doc/127480>.
@article{Śniady2007,
author = {Śniady, Piotr},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Young diagram; random permutation; random matrix},
language = {eng},
number = {1},
pages = {Research paper R11, 9 p.-Research paper R11, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Permutations without long decreasing subsequences and random matrices.},
url = {http://eudml.org/doc/127480},
volume = {14},
year = {2007},
}
TY - JOUR
AU - Śniady, Piotr
TI - Permutations without long decreasing subsequences and random matrices.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research paper R11, 9 p.
EP - Research paper R11, 9 p.
LA - eng
KW - Young diagram; random permutation; random matrix
UR - http://eudml.org/doc/127480
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.