Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
From MaRDI portal
Publication:534213
DOI10.1016/j.aam.2009.07.005zbMath1227.05262arXiv0801.1319MaRDI QIDQ534213
Publication date: 17 May 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.1319
05E05: Symmetric functions and generalizations
05E10: Combinatorial aspects of representation theory
60C05: Combinatorial probability
Related Items
The monoids of the patience sorting algorithm, Dynamics of plane partitions: Proof of the Cameron–Fon-Der-Flaass conjecture, Crystal structures for symmetric Grothendieck polynomials, \(K\)-Knuth equivalence for increasing tableaux, Poset edge densities, nearly reduced words, and barely set-valued tableaux, Combinatorics of \(K\)-theory via a \(K\)-theoretic Poirier-Reutenauer bialgebra, Vacillating Hecke tableaux and linked partitions, Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids, Shifted Hecke insertion and \(K\)-theory of \(OG(n,2n+1)\), Dual filtered graphs, Unique rectification in \(d\)-complete posets: towards the \(K\)-theory of Kac-Moody flag varieties, Chinese syzygies by insertions, Hook formulas for skew shapes. IV: Increasing tableaux and factorial Grothendieck polynomials, Crystal structures for canonical Grothendieck functions, Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes, Random plane partitions and corner distributions, Positive specializations of symmetric Grothendieck polynomials, Shifted Hecke insertion and the \(K\)-theory of \(\mathrm{OG}(n,2n+1)\), Genomic tableaux, Promotion of increasing tableaux: frames and homomesies, Cyclic sieving of increasing tableaux and small Schröder paths, A web basis of invariant polynomials from noncrossing partitions, Proof of the Cameron and Fon-Der-Flaass periodicity conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
- Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group
- An extension of Schensted's theorem
- A variational problem for random Young tableaux
- Noncommutative Schur functions and their applications
- Balanced tableaux
- A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
- Polygon dissections and standard Young tableaux
- Asymptotics of Plancherel-type random partitions
- Stable Grothendieck polynomials and \(K\)-theoretic factor sequences
- Permutations, matrices, and generalized Young tableaux
- On the longest increasing subsequence for finite and countable alphabets
- Combinatorics of Coxeter Groups
- Longest Increasing and Decreasing Subsequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Discrete orthogonal polynomial ensembles and the Plancherel measure
- On the distributions of the lengths of the longest monotone subsequences in random words