The surprising mathematics of longest increasing subsequences
From MaRDI portal
Recommendations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Limit shapes for random square Young tableaux
- On the distribution of the length of the longest increasing subsequence of random permutations
- The longest increasing subsequence in a random permutation and a unitary random matrix model
- Longest increasing subsequences in pattern-restricted permutations
Cited in
(only showing first 100 items - show all)- From Hammersley's lines to Hammersley's trees
- A note on the expected length of the longest common subsequences of two i.i.d. random permutations
- Neighborhood growth dynamics on the Hamming plane
- Longest increasing subsequences and log concavity
- Tropical plactic algebra, the cloaktic monoid, and semigroup representations
- The periodic Schur process and free fermions at finite temperature
- Asymptotics of the number of standard Young tableaux of skew shape
- Partial sum of matrix entries of representations of the symmetric group and its asymptotics
- Space-efficient algorithms for longest increasing subsequence
- Multiple phases in a generalized Gross-Witten-Wadia matrix model
- Lower bounds for superpatterns and universal sequences
- The BRS-inequality and its applications
- Asymptotics and renewal approximation in the online selection of increasing subsequence
- Diffusion approximations in the online increasing subsequence problem
- On sequential selection and a first passage problem for the Poisson process
- Poisson limit of bumping routes in the Robinson-Schensted correspondence
- Mapping TASEP Back in time
- Three-halves variation of geodesics in the directed landscape
- Fast and longest rollercoasters
- Hidden invariance of last passage percolation and directed polymers
- Universality for random permutations and some other groups
- Absorbing time asymptotics in the oriented swap process
- RSK in last passage percolation: a unified approach
- 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 \)
- Longest increasing paths with Lipschitz constraints
- Sorting networks, staircase Young tableaux, and last passage percolation
- Stieltjes moment sequences for pattern-avoiding permutations
- Asymptotic expansions and strategies in the online increasing subsequence problem
- Random plane partitions and corner distributions
- Random sorting networks: local statistics via random matrix laws
- Positive specializations of symmetric Grothendieck polynomials
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- Co-divergence and tree topology
- On-line scheduling with monotone subsequence constraints
- Isotonic regression in general dimensions
- Jeu de taquin dynamics on infinite Young tableaux and second class particles
- Book review of: D. Romik, The surprising mathematics of longest increasing subsequences
- The reverse mathematics of non-decreasing subsequences
- A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer
- Regenerative random permutations of integers
- On the largest Kronecker and Littlewood-Richardson coefficients
- Multicritical random partitions
- Muttalib-Borodin plane partitions and the hard edge of random matrix ensembles
- 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
- Efficient methods of calculating the number of heapable permutations
- Continuously increasing subsequences of random multiset permutations
- Quickest online selection of an increasing subsequence of specified size
- Sequential selection of a monotone subsequence from a random permutation
- Heapability, interactive particle systems, partial orders: results and open problems
- Empirical scaling of the length of the longest increasing subsequences of random walks
- A limit theorem for stochastically decaying partitions at the edge
- Hankel determinant and orthogonal polynomials for a Gaussian weight with a discontinuity at the edge
- Universality of random permutations
- Space-efficient algorithms for longest increasing subsequence
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function
- Limit shapes of bumping routes in the Robinson-Schensted correspondence
- The Longest Almost-Increasing Subsequence
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Commentary on ``Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem by David Aldous and Persi Diaconis
- Online scheduling with increasing subsequence serving constraint
- On-line Scheduling with a Monotonous Subsequence Constraint
- Optimal online selection of a monotone subsequence: a central limit theorem
- Buses, bullies, and bijections
- Longest increasing paths with gaps
- On the origins of Riemann–Hilbert problems in mathematics*
- Periodic P\'olya urns and an application to Young tableaux
- Rollercoasters and caterpillars
- On the largest common subtree of random leaf-labeled binary trees
- Spin correlation functions, Ramus-like identities, and enumeration of constrained lattice walks and plane partitions
- 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
- On the Okounkov-Olshanski formula for standard tableaux of skew shapes
- A view from the bridge spanning combinatorics and probability
- Fast and longest rollercoasters
- The Archimedean limit of random sorting networks
- scientific article; zbMATH DE number 7250398 (Why is no real title available?)
- On the passage time geometry of the last passage percolation problem
- Longest increasing subsequences in involutions avoiding patterns of length three
- Limit shapes via bijections
- Rollercoasters: Long Sequences without Short Runs
- Asymptotics for skew standard Young tableaux via bounds for characters
- On the limiting law of the length of the longest common and increasing subsequences in random words
- Increasing subsequences of random walks
- On the limiting distributions of the total height on families of trees
- Bounds on the largest Kronecker and induced multiplicities of finite groups
- Combinatorics and random matrix theory
- Limit shape for infinite rank limit of tensor power decomposition for Lie algebras of series so2n+1 *
- Double interlacing in random tiling models
- Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings
- On random shifted standard Young tableaux and 132-avoiding sorting networks
- On random shifted standard Young tableaux and 132-avoiding sorting networks
- A Plancherel measure associated to set partitions and its limit
- Tableau stabilization and lattice paths
- 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
This page was built for publication: The surprising mathematics of longest increasing subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930844)
