Restricted 132-Dumont permutations

Details Restricted 132-Dumont permutations Restricted 132-Dumont permutations

2002-09-27

arxiv.org/abs/math/0209379v2

Australasian Journal of Combinatorics, 2003

Mathematics

Combinatorics

12 pages

Scientific paper

A permutation $\pi$ is said to be {\em Dumont permutations of the first kind} if each even integer in $\pi$ must be followed by a smaller integer, and each odd integer is either followed by a larger integer or is the last element of $\pi$ (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$.

Affiliated with

Also associated with

No associations

Rating

Restricted 132-Dumont permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Restricted 132-Dumont permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted 132-Dumont permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-433935