Counting permutations with no long monotone subsequence via generating trees and the kernel method
From MaRDI portal
Publication:536566
DOI10.1007/s10801-010-0259-zzbMath1226.05003arXiv1006.0311OpenAlexW1969896754MaRDI QIDQ536566
Publication date: 19 May 2011
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.0311
Related Items
Counting quadrant walks via Tutte's invariant method, An elementary solution of Gessel's walks in the quadrant, A generating tree approach to \(k\)-nonnesting partitions and permutations, Stieltjes moment sequences for pattern-avoiding permutations, An infinite family of inv-Wilf-equivalent permutation pairs, On the number of walks in a triangular domain
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Walks in the quarter plane: Kreweras' algebraic model
- Bijections for refined restricted permutations
- Generating-tree isomorphisms for pattern-avoiding involutions
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- D-finite power series
- Symmetric functions and P-recursiveness
- Determinant formulas relating to tableaux of bounded height
- On bijections for pattern-avoiding permutations
- The diagonal of a D-finite power series is D-finite
- A linear operator for symmetric functions and tableaux in a strip with given trace
- On a correspondence between binary trees and a certain type of permutation
- Applications of minor summation formulas to rectangular-shaped representations of classical groups
- Advanced determinant calculus
- Generating functions for generating trees
- Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
- Refined restricted permutations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Linear recurrences with constant coefficients: The multivariate case
- The kernel method: a collection of examples
- Restricted permutations from Catalan to Fine and back
- Algebraic aspects of increasing subsequences
- Generating trees and the Catalan and Schröder numbers
- Generating trees and forbidden subsequences
- Character polynomials, their \(q\)-analogs and the Kronecker product.
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Enumeration of plane partitions
- Wilf-equivalence for singleton classes
- Walks with small steps in the quarter plane
- Longest Increasing and Decreasing Subsequences
- Vicious Walkers and Random Contraction Matrices
- New equivalences for pattern avoiding involutions
- Random Walk in a Weyl Chamber
- On the distribution of the length of the longest increasing subsequence of random permutations
- Bijective enumeration of permutations starting with a longest increasing subsequence
- Permutations with restricted patterns and Dyck paths
