Pages that link to "Item:Q4269106"

The following pages link to Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem (Q4269106):

Displaying 50 items.

• The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets (Q2218834) (← links)
• Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences (Q2300588) (← links)
• On the topology of complexes of injective words (Q2304016) (← links)
• Combinatorics of patience sorting monoids (Q2312800) (← links)
• On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
• Lengths of monotone subsequences in a Mallows permutation (Q2343030) (← links)
• Multi-state asymmetric simple exclusion processes (Q2355674) (← links)
• When the law of large numbers fails for increasing subsequences of random permutations (Q2371955) (← links)
• Longest monotone subsequences and rare regions of pattern-avoiding permutations (Q2409846) (← links)
• On the largest Kronecker and Littlewood-Richardson coefficients (Q2424903) (← links)
• Letter change bias and local uniqueness in optimal sequence alignments (Q2440343) (← links)
• Tropical combinatorics and Whittaker functions (Q2444653) (← links)
• Expected lengths and distribution functions for Young diagrams in the hook (Q2455513) (← links)
• Random matrix central limit theorems for nonintersecting random walks (Q2456030) (← links)
• Average case analysis of disk scheduling, increasing subsequences and spacetime geometry (Q2461547) (← links)
• A geometric form for the extended patience sorting algorithm (Q2490023) (← links)
• A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530) (← links)
• Counting formulas associated with some random matrix averages (Q2500609) (← links)
• On the distribution of the length of the longest increasing subsequence in a random permutation (Q2516396) (← links)
• Spatial random permutations and infinite cycles (Q2517970) (← links)
• Expected length of the longest common subsequence for large alphabets (Q2573406) (← links)
• Limit shapes for random square Young tableaux (Q2643866) (← links)
• A central limit theorem for the length of the longest common subsequences in random words (Q2679696) (← links)
• Finite size corrections relating to distributions of the length of longest increasing subsequences (Q2687279) (← links)
• The Preisach graph and longest increasing subsequences (Q2693181) (← links)
• Integrals over classical groups, random permutations, Toda and Toeplitz lattices (Q2710678) (← links)
• Random matrix theory over finite fields (Q2761195) (← links)
• Quickest online selection of an increasing subsequence of specified size (Q2820269) (← links)
• Order-Invariant Measures on Fixed Causal Sets (Q2888866) (← links)
• THE KARDAR–PARISI–ZHANG EQUATION AND UNIVERSALITY CLASS (Q2893149) (← links)
• RIGHT TAIL ASYMPTOTIC EXPANSION OF TRACY–WIDOM BETA LAWS (Q2920377) (← links)
• Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process (Q2942262) (← links)
• Empirical scaling of the length of the longest increasing subsequences of random walks (Q2969875) (← links)
• Longest convex chains (Q3055769) (← links)
• Zero Biasing and Jack Measures (Q3103625) (← links)
• A simple derivation of the Tracy–Widom distribution of the maximal eigenvalue of a Gaussian unitary random matrix (Q3301240) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• Bounds on the Expected Size of the Maximum Agreement Subtree (Q3449864) (← links)
• Stein's method and random character ratios (Q3508035) (← links)
• Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis (Q4569539) (← links)
• The monoids of the patience sorting algorithm (Q4629511) (← links)
• Moderate deviations for longest increasing subsequences: The upper tail (Q4790262) (← links)
• Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture (Q4804131) (← links)
• Stein’s method and Plancherel measure of the symmetric group (Q4825665) (← links)
• GENERALIZED RANDOM MATRIX THEORY: A MATHEMATICAL PROBE FOR COMPLEXITY (Q4914493) (← links)
• Asymptotics of Plancherel measures for symmetric groups (Q4955883) (← links)
• (Q4993799) (← links)
• Relating random matrix map enumeration to a universal symbol calculus for recurrence operators in terms of Bessel–Appell polynomials (Q5041690) (← links)
• Maxima of log-correlated fields: some recent developments* (Q5049535) (← links)
• Variations on Hammersley’s interacting particle process (Q5051443) (← links)