The Surprising Mathematics of Longest Increasing Subsequences
From MaRDI portal
Publication:2930844
DOI10.1017/CBO9781139872003zbMath1345.05003OpenAlexW4299910743MaRDI QIDQ2930844
Publication date: 20 November 2014
Full work available at URL: https://doi.org/10.1017/cbo9781139872003
permutationsYoung diagramslongest increasing subsequencesBaik-Deift-Johannson theoremPlancheral measureUlam-Hammerseley problem
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Related Items (only showing first 100 items - show all)
Hidden invariance of last passage percolation and directed polymers ⋮ Limit shape for infinite rank limit of tensor power decomposition for Lie algebras of series so2n+1 * ⋮ Universality for random permutations and some other groups ⋮ Double interlacing in random tiling models ⋮ Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings ⋮ Absorbing time asymptotics in the oriented swap process ⋮ Spin correlation functions, Ramus-like identities, and enumeration of constrained lattice walks and plane partitions ⋮ RSK in last passage percolation: a unified approach ⋮ Monotone subsets in lattices and the Schensted shape of a Sós permutation ⋮ Variations on Hammersley’s interacting particle process ⋮ Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ A view from the bridge spanning combinatorics and probability ⋮ Longest increasing paths with gaps ⋮ A limit theorem for stochastically decaying partitions at the edge ⋮ Skew shape asymptotics, a case-based introduction ⋮ Statistics of irreducible components in large tensor powers of the spinor representation for \(\mathfrak{so}_{2n+1}\) as \(n \rightarrow \infty \) ⋮ Hankel determinant and orthogonal polynomials for a Gaussian weight with a discontinuity at the edge ⋮ From Hammersley's lines to Hammersley's trees ⋮ On the variance of the optimal alignments score for binary random words and an asymmetric scoring function ⋮ Unnamed Item ⋮ A note on the expected length of the longest common subsequences of two i.i.d. random permutations ⋮ Limit shapes of bumping routes in the Robinson-Schensted correspondence ⋮ Longest increasing paths with Lipschitz constraints ⋮ Periodic P\'olya urns and an application to Young tableaux ⋮ Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis ⋮ A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer ⋮ Neighborhood growth dynamics on the Hamming plane ⋮ Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ The Archimedean limit of random sorting networks ⋮ Longest increasing subsequences and log concavity ⋮ Last passage isometries for the directed landscape ⋮ Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm ⋮ The oriented swap process and last passage percolation ⋮ The semiclassical limit of a quantum Zeno dynamics ⋮ Regenerative random permutations of integers ⋮ Multicritical random partitions ⋮ Muttalib-Borodin plane partitions and the hard edge of random matrix ensembles ⋮ On the largest Kronecker and Littlewood-Richardson coefficients ⋮ Poisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process ⋮ Finite size corrections relating to distributions of the length of longest increasing subsequences ⋮ Increasing subsequences of random walks ⋮ Sorting networks, staircase Young tableaux, and last passage percolation ⋮ Efficient methods of calculating the number of heapable permutations ⋮ Empirical scaling of the length of the longest increasing subsequences of random walks ⋮ Continuously increasing subsequences of random multiset permutations ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ Bounds on the largest Kronecker and induced multiplicities of finite groups ⋮ Tropical plactic algebra, the cloaktic monoid, and semigroup representations ⋮ Online Scheduling with Increasing Subsequence Serving Constraint ⋮ On-line Scheduling with a Monotonous Subsequence Constraint ⋮ The periodic Schur process and free fermions at finite temperature ⋮ Rollercoasters and Caterpillars ⋮ Asymptotic expansions and strategies in the online increasing subsequence problem ⋮ Universality of random permutations ⋮ Quantum spectrum testing ⋮ Random plane partitions and corner distributions ⋮ Optimal online selection of a monotone subsequence: a central limit theorem ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Asymptotics of the number of standard Young tableaux of skew shape ⋮ Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree ⋮ Multiple phases in a generalized Gross-Witten-Wadia matrix model ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words ⋮ Random sorting networks: local statistics via random matrix laws ⋮ Unnamed Item ⋮ Partial sum of matrix entries of representations of the symmetric group and its asymptotics ⋮ A Plancherel measure associated to set partitions and its limit ⋮ On The Limiting Distributions of the Total Height On Families of Trees ⋮ Lower bounds for superpatterns and universal sequences ⋮ The BRS-inequality and its applications ⋮ Asymptotics and renewal approximation in the online selection of increasing subsequence ⋮ Buses, Bullies, and Bijections ⋮ Positive specializations of symmetric Grothendieck polynomials ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ Diffusion approximations in the online increasing subsequence problem ⋮ Tableau stabilization and lattice paths ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ On the Okounkov-Olshanski formula for standard tableaux of skew shapes ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ Limit Shapes via Bijections ⋮ On the Geometry of the Last Passage Percolation Problem ⋮ Unnamed Item ⋮ Quickest online selection of an increasing subsequence of specified size ⋮ Sequential selection of a monotone subsequence from a random permutation ⋮ On sequential selection and a first passage problem for the Poisson process ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems ⋮ Poisson limit of bumping routes in the Robinson-Schensted correspondence ⋮ Co-divergence and tree topology ⋮ Rollercoasters: Long Sequences without Short Runs ⋮ Asymptotics for skew standard Young tableaux via bounds for characters ⋮ On the origins of Riemann–Hilbert problems in mathematics* ⋮ On-line scheduling with monotone subsequence constraints ⋮ Mapping TASEP Back in time ⋮ Isotonic regression in general dimensions ⋮ Periodic Pólya urns, the density method and asymptotics of Young tableaux ⋮ Dual Grothendieck polynomials via last-passage percolation ⋮ Three-halves variation of geodesics in the directed landscape ⋮ Jeu de taquin dynamics on infinite Young tableaux and second class particles ⋮ On the Largest Common Subtree of Random Leaf-Labeled Binary Trees ⋮ Fast and longest rollercoasters ⋮ Asymptotics of some Plancherel averages via polynomiality results
This page was built for publication: The Surprising Mathematics of Longest Increasing Subsequences
