Longest Increasing and Decreasing Subsequences
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Young-Fibonacci insertion, tableauhedron and Kostka numbers
- On (0, 1)-matrices with prescribed row and column sum vectors
- Untangling a planar graph
- Almost avoiding permutations
- A Schensted algorithm for rim hook tableaux
- Shuffles of permutations and the Kronecker product
- On growing a random Young tableau
- Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux
- Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
- Permutation statistics and (k,)-hook Schur functions
- Standard Young tableaux of height 4 and 5
- An analog of Schensted's algorithm for shifted Young tableaux
- A Polya interpretation of the Schur function
- On the equality of two plane partition correspondences
- The number of increasing subsequences of the random permutation
- Some connections between the Littlewood-Richardson rule and the construction of Schensted
- The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
- Tournaments and generalized Young tableaux
- Some aspects of groups acting on finite posets
- Coinsertion and standard bitableaux
- The number of involutions with \(r\) fixed points and a long increasing subsequence
- Tableaux and insertion schemes for spinor representations of the orthogonal Lie algebra \(so(2r+1,\mathbb{C})\)
- Generalized roinsertive correspondence between multitableaux and multimonomials
- The generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\)
- A Robinson-Schensted-type algorithm for \(SO(2n,\mathbb{C})\)
- Generalized rodeletive correspondence between multitableaux and multimonomials
- Algorithms for generating labelled graphs with given degree
- On a bijection between Littlewood-Richardson fillings of conjugate shape
- Eulerian numbers, tableaux, and the Betti numbers of a toric variety
- On the representation theory of the symmetric groups and associated Hecke algebras
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- A Robinson-Schensted-type correspondence for a dual pair on spinors
- Generalized coinsertion and standard multitableaux
- An extension of Schensted's theorem
- On a correspondence between binary trees and a certain type of permutation
- Enumeration of permutations with prescribed up-down and inversion sequences
- On a construction of Schätzenberger
- A variational problem for random Young tableaux
- Ascending sequences in permutations
- Some results on hook lengths
- Enumeration des tableaux Standards
- On Schensted's construction and the multiplication of Schur functions
- Percentage-avoiding, northwest shapes and peelable tableaux
- A characteristic property of labelings and linear extensions of posets of dimension 2
- On odd symplectic Schur functions
- Multiplying Schur \(Q\)-functions
- Enumerative aspects of certain subclasses of perfect graphs
- Counting permutations with given cycle structure and descent set
- Generalized Robinson-Schensted correspondence: A new algorithm
- Duality of graded graphs
- Schensted algorithms for dual graded graphs
- An alternative presentation of the Schensted correspondence
- Combinatorial \(R\) matrices for a family of crystals: \(B_n^{(1)}\), \(D_n^{(1)}\), \(A_{2n}^{(2)}\) and \(D_{n+1}^{(2)}\) cases
- A Robinson-Schensted algorithm for a class of partial orders
- Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
- Sequences of symmetric polynomials and combinatorial properties of tableaux
- Lyndon words, permutations and trees.
- Plactic algebras.
- Anisotropic Young diagrams and Jack symmetric functions
- Affine type A crystal structure on tensor products of rectangles, Demazure characters, and nilpotent varieties
- Shape avoiding permutations
- Brauer diagrams, updown tableaux and nilpotent matrices
- Hall-Littlewood RSK field
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- Quasisymmetric and noncommutative skew Pieri rules
- On embedding certain Kazhdan-Lusztig cells of \(S_n\) into cells of \(S_{n+1}\)
- An orthosymplectic Pieri rule
- Knuth's coherent presentations of plactic monoids of type A
- Longest increasing subsequences and log concavity
- Limit theorems for longest monotone subsequences in random Mallows permutations
- Monotonous subsequences and the descent process of invariant random permutations
- Tropical plactic algebra, the cloaktic monoid, and semigroup representations
- General tests of independence based on empirical processes indexed by functions
- \(R\)-systems
- Lattice paths, Young tableaux, and weight multiplicities
- Improvised divide and conquer approach for the LIS problem
- A generalization of plactic-coplactic equivalences and Kazhdan-Lusztig cells.
- The peak algebra of the symmetric group revisited.
- Factorization of the Robinson-Schensted-Knuth correspondence
- Action of the symmetric group on sets of skew-tableaux with prescribed matrix realization
- A Nekrasov-Okounkov formula for Macdonald polynomials
- Rank tests from partially ordered data using importance and MCMC sampling methods
- Zigzag diagrams and Martin boundary
- A Pieri formula in the Grothendieck ring of a flag bundle
- Bases for coordinate rings of conjugacy classes of nilpotent matrices
- Bijection between indexed monomials and standard bitableaux
- Balanced tableaux
- Gröbner bases and Stanley decompositions of determinantal ideals
- Explicit enumeration of 321, hexagon-avoiding permutations
- Tableau atoms and a new Macdonald positivity conjecture
- Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles
- Longest increasing subsequences in sliding windows
- The Robinson-Schensted correspondence for skew oscillating tableaux
- Generating trees and the Catalan and Schröder numbers
- Tableau algorithms defined naturally for pictures
- The bijection between plane partitions and nonnegative matrices
- Pattern avoidance in matchings and partitions
- Fast computation of a longest increasing subsequence and application
- On extremal permutations avoiding _N=NN-1 1
- Schubert polynomials, the Bruhat order, and the geometry of flag manifolds
This page was built for publication: Longest Increasing and Decreasing Subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3276710)