Permutations with restricted patterns and Dyck paths
From MaRDI portal
Publication:5956779
DOI10.1006/aama.2001.0747zbMath0994.05001arXivmath/0002200OpenAlexW2048655899MaRDI QIDQ5956779
Publication date: 10 October 2002
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0002200
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Continued fractions and generalizations (11J70)
Related Items
Continued fractions and generalized patterns, Old and young leaves on plane trees, A combinatorial bijection on di-sk trees, On pattern avoiding flattened set partitions, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers, Pattern avoidance in poset permutations, Refined restricted involutions, Chains of maximum length in the Tamari lattice, Restricted Dumont permutations, Dyck paths, and noncrossing partitions, Random cyclic dynamical systems, Bijections for refined restricted permutations, Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations, Restricted colored permutations and Chebyshev polynomials, Restricted simsun permutations, Inversion polynomials for 321-avoiding permutations, Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths, Restricted generating trees for weak orderings, The shape of random pattern-avoiding permutations, Refining enumeration schemes to count according to permutation statistics, Rationality for subclasses of 321-avoiding permutations, Inversion formulae on permutations avoiding 321, Equidistributions of Mahonian statistics over pattern avoiding permutations, Permutations avoiding 4321 and 3241 have an algebraic generating function, Integrability properties of Motzkin polynomials, A catalanization map on the symmetric group, On the diagram of 132-avoiding permutations, Two involutions on binary trees and generalizations, Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three, Patterns in Random Permutations Avoiding the Pattern 132, Permutations and pairs of Dyck paths, Knight's paths towards Catalan numbers, Pattern avoidance in matchings and partitions, Stieltjes moment sequences for pattern-avoiding permutations, $k$-Arrangements, Statistics, and Patterns, Lifshitz tails on the Bethe lattice: A combinatorial approach, Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\), Counting strings in Dyck paths, Refined restricted inversion sequences, Semi-perimeter and inner site-perimeter of k-ary words and bargraphs, Pattern avoidance in biwords, Enumeration of Dumont permutations avoiding certain four-letter patterns, Visibility in restricted involutions, Fixed points of 321-avoiding permutations, Pattern-avoiding permutations and Brownian excursion. II: Fixed points, Counting permutations with no long monotone subsequence via generating trees and the kernel method, Pattern frequency sequences and internal zeros, Enumeration of ad-nilpotent \({\mathfrak b}\)-ideals for simple Lie algebras, Restricted 132-avoiding permutations, Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations, Restricted involutions and Motzkin paths, A history and a survey of lattice path enumeration, Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions, Decreasing subsequences in permutations and Wilf equivalence for involutions, Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials, The pure descent statistic on permutations, The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials, Restricted even permutations and Chebyshev polynomials, Dyck paths and restricted permutations, Another look at bijections for pattern-avoiding permutations, Counting domino tilings of rectangles via resultants, An involution on Dyck paths that preserves the rise composition and interchanges the number of returns and the position of the first double fall, Pattern statistics in faro words and permutations, Variations of the Catalan numbers from some nonassociative binary operations, On pattern-avoiding Fishburn permutations, The sets of flattened partitions with forbidden patterns, Refined Wilf-equivalences by Comtet statistics, Stack sorting with restricted stacks, Distributions of Statistics over Pattern-Avoiding Permutations, Structure of random 312-avoiding permutations, The operators \(F_i\) on permutations, 132-avoiding permutations and inversions, Restricted permutations refined by number of crossings and nestings, On bijections for pattern-avoiding permutations, Pattern avoidance in ``flattened partitions, Generalized triangulations and diagonal-free subsets of stack polyominoes, Motzkin paths, Motzkin polynomials and recurrence relations, Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial aspects of continued fractions
- Forbidden subsequences and Chebyshev polynomials
- Permutation patterns and continued fractions
- Some combinatorial properties of Schubert polynomials
- Continued fractions and Catalan problems
- Generating trees and the Catalan and Schröder numbers
- Combinatorial theory of \(\text{T}\)-fractions and two points Padé approximants
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Simple random walk statistics. Part I: Discrete time results
- Restricted permutations
