Pages that link to "Item:Q3276710"
From MaRDI portal
The following pages link to Longest Increasing and Decreasing Subsequences (Q3276710):
Displayed 50 items.
- Action of the symmetric group on sets of skew-tableaux with prescribed matrix realization (Q1779395) (← links)
- A Nekrasov-Okounkov formula for Macdonald polynomials (Q1785712) (← links)
- Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
- Zigzag diagrams and Martin boundary (Q1800814) (← links)
- A Pieri formula in the Grothendieck ring of a flag bundle (Q1804666) (← links)
- Bases for coordinate rings of conjugacy classes of nilpotent matrices (Q1806090) (← links)
- Bijection between indexed monomials and standard bitableaux (Q1812781) (← links)
- Balanced tableaux (Q1821102) (← links)
- Gröbner bases and Stanley decompositions of determinantal ideals (Q1825907) (← links)
- Explicit enumeration of 321, hexagon-avoiding permutations (Q1827678) (← links)
- Tableau atoms and a new Macdonald positivity conjecture (Q1872788) (← links)
- Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles (Q1873816) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- The Robinson-Schensted correspondence for skew oscillating tableaux (Q1893982) (← links)
- Generating trees and the Catalan and Schröder numbers (Q1903733) (← links)
- Tableau algorithms defined naturally for pictures (Q1924375) (← links)
- The bijection between plane partitions and nonnegative matrices (Q1925164) (← links)
- Pattern avoidance in matchings and partitions (Q1953480) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) (Q1970072) (← links)
- Schubert polynomials, the Bruhat order, and the geometry of flag manifolds (Q1974865) (← links)
- Flag varieties and interpretations of Young tableau algorithms (Q1975155) (← links)
- Pattern avoidance and quasisymmetric functions (Q1985356) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- A \(q\)-deformation of the symplectic Schur functions and the Berele insertion algorithm (Q1990207) (← links)
- A simple counting argument of the irreducible representations of \(\mathsf{SU}(N)\) on mixed product spaces (Q2011390) (← links)
- A generalization of Edelman-Greene insertion for Schubert polynomials (Q2031621) (← links)
- Bigrassmannian permutations and Verma modules (Q2037138) (← links)
- Tableau stabilization and rectangular tableaux fixed by promotion powers (Q2038903) (← links)
- Block number, descents and Schur positivity of fully commutative elements in \(B_n\) (Q2066000) (← links)
- Chinese syzygies by insertions (Q2070976) (← links)
- Grammic monoids with three generators (Q2099140) (← links)
- The Burge correspondence and crystal graphs (Q2107508) (← links)
- Doubly stochastic matrices and Schur-Weyl duality for partition algebras (Q2112559) (← links)
- Multiplicities of some maximal dominant weights of the \(\widehat{s\ell }(n)\)-modules \(V (k \Lambda_0)\) (Q2118271) (← links)
- Fast and longest rollercoasters (Q2118392) (← links)
- Invariance of polymer partition functions under the geometric RSK correspondence (Q2119910) (← links)
- A pair of dual Hopf algebras on permutations (Q2133254) (← links)
- RSK in last passage percolation: a unified approach (Q2135724) (← links)
- Orthosymplectic Cauchy identities (Q2155541) (← links)
- The stylic monoid (Q2163861) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- An insertion algorithm on multiset partitions with applications to diagram algebras (Q2178556) (← links)
- Modular Nekrasov-Okounkov formulas (Q2186833) (← links)
- An insertion algorithm for diagram algebras (Q2199840) (← links)
- Plactic monoids: a braided approach (Q2201074) (← links)
- On the longest common subsequence of conjugation invariant random permutations (Q2205121) (← links)
- The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets (Q2218834) (← links)
- Computing a longest common almost-increasing subsequence of two sequences (Q2220858) (← links)