Pages that link to "Item:Q3276710"
From MaRDI portal
The following pages link to Longest Increasing and Decreasing Subsequences (Q3276710):
Displaying 50 items.
- Two descent statistics over \(321\)-avoiding centrosymmetric involutions (Q252851) (← links)
- The estimate of the number of permutationally-ordered sets (Q253952) (← links)
- Notes on Schubert, Grothendieck and key polynomials (Q274868) (← links)
- Recognizable subsets of the two letter plactic monoid (Q287233) (← links)
- Word reading is a crystal morphism (Q292184) (← links)
- Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- A central limit theorem for extremal characters of the infinite symmetric group. (Q366058) (← links)
- An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors (Q393474) (← links)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns (Q405257) (← links)
- Crystal \(B(\lambda)\) as a subset of crystal \(B(\infty)\) expressed as tableaux for \(A_n\) type (Q405827) (← links)
- Oscillating rim hook tableaux and colored matchings (Q408123) (← links)
- Modified growth diagrams, permutation pivots, and the BWX map \(\phi ^{\ast}\) (Q423647) (← links)
- Words and polynomial invariants of finite groups in non-commutative variables (Q434230) (← links)
- Signed enumeration of ribbon tableaux: an approach through growth diagrams (Q438737) (← links)
- Descent sets on 321-avoiding involutions and hook decompositions of partitions (Q458291) (← links)
- A symmetry property for \(q\)-weighted Robinson-Schensted and other branching insertion algorithms (Q472629) (← links)
- On increasing subsequences of minimal Erdős-Szekeres permutations (Q475768) (← links)
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
- New approaches to plactic monoid via Gröbner-Shirshov bases. (Q479745) (← links)
- Matrices, characters and descents (Q486222) (← links)
- Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson-Schensted-Knuth-type correspondence for quasi-ribbon tableaux (Q517358) (← links)
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm (Q534213) (← links)
- Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566) (← links)
- Evacuation and a geometric construction for Fibonacci tableaux (Q556863) (← links)
- The algebra of binary search trees (Q557924) (← links)
- Rational tableaux and the tensor algebra of \(gl_ n\) (Q580499) (← links)
- Tableaux and matrix correspondences (Q595665) (← links)
- Bijections for refined restricted permutations (Q598452) (← links)
- A Pieri rule for skew shapes (Q616458) (← links)
- On the Lipschitz constant of the RSK correspondence (Q645961) (← links)
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (Q659582) (← links)
- Enumeration of generalized Young tableaux with bounded height (Q688688) (← links)
- Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams (Q739392) (← links)
- Structure constants for \(K\)-theory of Grassmannians, revisited (Q739394) (← links)
- Multicolored permutations, sequences, and tableaux (Q757371) (← links)
- Orthogonal tableaux and an insertion algorithm for \(SO(2n+1)\) (Q757444) (← links)
- The longest almost-increasing subsequence (Q765507) (← links)
- A bijection proving orthogonality of the characters of \(S_ n\) (Q790811) (← links)
- Hook flag characters and their combinatorics (Q798762) (← links)
- Hybrid tableaux and the Littlewood-Richardson rule (Q809103) (← links)
- Robinson-Schensted algorithms for skew tableaux (Q809104) (← links)
- Multivariate polynomials, standard tableaux, and representations of symmetric groups (Q810138) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- Diagonal invariants and the refined multimahonian distribution. (Q835657) (← links)
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- On the longest increasing subsequence of a circular list (Q845894) (← links)
- Polynuclear growth on a flat substrate and edge scaling of GOE eigenvalues (Q850953) (← links)
- Refined restricted involutions (Q854848) (← links)
