Restricted 132-Dumont permutations
| dc.creator | Mansour, T. | |
| dc.date | 2002-09-27 | |
| dc.date | 2002-11-26 | |
| dc.date.accessioned | 2026-07-07T04:51:18Z | |
| dc.date.available | 2026-07-07T04:51:18Z | |
| dc.description | A permutation $π$ is said to be {\em Dumont permutations of the first kind} if each even integer in $π$ must be followed by a smaller integer, and each odd integer is either followed by a larger integer or is the last element of $π$ (see, for example, \cite{Z}). In \cite{D} Dumont showed that certain classes of permutations on $n$ letters are counted by the Genocchi numbers. In particular, Dumont showed that the $(n+1)$st Genocchi number is the number of Dummont permutations of the first kind on $2n$ letters. In this paper we study the number of Dumont permutations of the first kind on $n$ letters avoiding the pattern 132 and avoiding (or containing exactly once) an arbitrary pattern on $k$ letters. In several interesting cases the generating function depends only on $k$. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/math/0209379 | |
| dc.identifier | http://arxiv.org/abs/math/0209379 | |
| dc.identifier | Australasian Journal of Combinatorics, 2003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65098 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05 | |
| dc.title | Restricted 132-Dumont permutations | |
| dc.type | text |