Abstract
In this paper, we study the generating functions for the number of permutations having a prescribed number of cyclic peaks or valleys. We derive closed form expressions for these functions by use of various algebraic methods. When restricted to the set of derangements (i.e., fixed point free permutations), the evaluation at −1 of the generating function for the number of cyclic valleys gives the Pell number. We provide a bijective proof of this result, which can be extended to the entire symmetric group.
Original language | English |
---|---|
Pages (from-to) | 43-54 |
Number of pages | 12 |
Journal | Annales Mathematicae et Informaticae |
Volume | 43 |
State | Published - 2014 |
Bibliographical note
Publisher Copyright:© 2014, Eszterhazy Karoly College. All rights reserved.
Keywords
- Cyclic valleys
- Derangements
- Involutions
- Pell numbers
ASJC Scopus subject areas
- General Computer Science
- General Mathematics