Continued fractions and Catalan problems
| dc.creator | Jani, Mahendra | |
| dc.creator | Rieper, Robert G. | |
| dc.date | 2000-01-16 | |
| dc.date.accessioned | 2026-07-07T04:33:21Z | |
| dc.date.available | 2026-07-07T04:33:21Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0001091 | |
| dc.identifier | http://arxiv.org/abs/math/0001091 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/58539 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A; 05C30 | |
| dc.title | Continued fractions and Catalan problems | |
| dc.type | text |