Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3
| dc.creator | Fulmek, Markus | |
| dc.date | 2001-12-10 | |
| dc.date | 2002-04-17 | |
| dc.date.accessioned | 2026-07-07T04:45:08Z | |
| dc.date.available | 2026-07-07T04:45:08Z | |
| dc.description | We consider the problem of enumerating the permutations containing exactly $k$ occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a formula which so far only was conjectured (by Noonan and Zeilberger). This approach is based on bijections from permutations to certain lattice paths with ``jumps'', which were first considered by Krattenthaler. | |
| dc.description | Fixed errors in equation (19) and in the paper's last equation | |
| dc.identifier | https://arxiv.org/abs/math/0112092 | |
| dc.identifier | http://arxiv.org/abs/math/0112092 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62856 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3 | |
| dc.type | text |