A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on c...

ABSTRACT. 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 subsequence is not bigger than a fixed number d; in other words we study the restriction of the Plancherel measure to Young diagrams with at most d rows. We prove that in the limit n → ∞ the rows of λ behave like ...

Given a sequence π1π2 . . . πn, a longest increasing subsequence (LIS) in a window π〈l, r〉= πlπl+1 . . . πr is a longest subsequence σ = πi1πi2 . . . πiT such that l ≤ i1 < i2 < · · · < iT ≤ r and πi1 < πi2 < · · · < πiT . We consider the Lisw problem, which is to find the longest increasing subsequences in a sliding window of fixed-size w over a sequence. Formally, it is to find a LIS for ever...

We establish that the static height fluctuations of a particular growth model, the PNG droplet, converges upon proper rescaling to a limit process, which we call the Airy process, A(y). The Airy process is stationary, it has continuous sample paths, its single “time” (fixed y) distribution is the Tracy–Widom distribution of the largest eigenvalue of a GUE random matrix, and the Airy process has...

We establish that the static height fluctuations of a particular growth model, the PNG droplet, converges upon proper rescaling to a limit process, which we call the Airy process, A(y). The Airy process is stationary, it has continuous sample paths, its single “time” (fixed y) distribution is the Tracy–Widom distribution of the largest eigenvalue of a GUE random matrix, and the Airy process has...

We survey three recent breakthroughs in algebraic combinatorics. The first is the proof by Knutson and Tao, and later Derksen and Weyman, of the saturation conjecture for Littlewood-Richardson coefficients. The second is the proof of the n! and (n + 1)n−1 conjectures by Haiman. The final breakthrough is the determination by Baik, Deift, and Johansson of the limiting behavior of the length of th...