Sciweavers

    125
    Voted
    COMBINATORICS
    2007
    99views more  COMBINATORICS 2007»
    Permutations Without Long Decreasing Subsequences and Random Matrices
    15 years 2 months ago
    Permutations Without Long Decreasing Subsequences and Random Matrices
    Download  www.combinatorics.org
    We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
    Piotr Sniady
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.