Continued fractions and Catalan problems
From MaRDI portal
Abstract: We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also expressed as a continued fraction. Among these problems is the enumeration of (132)-pattern avoiding permutations that have a given number of increasing patterns of length k. This extends and illuminates a result of Robertson, Wilf and Zeilberger for the case k=3.
Recommendations
Cited in
(8)- Permutations restricted by two distinct patterns of length three
- Pattern frequency sequences and internal zeros
- Continued fractions and generalized patterns
- Permutation patterns and continued fractions
- Permutations with restricted patterns and Dyck paths
- A history and a survey of lattice path enumeration
- New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations
- Two involutions on binary trees and generalizations
This page was built for publication: Continued fractions and Catalan problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583613)