l Counting derangements with ascents and descents in given positions
Speaker
l Seo Seunghyun (Kangwon National University)
Date
l 2009-08-21
Link
l
DownLoad
l
Etc
l 2009 Combinatorics Workshop
A derangement is a permutation without any fixed points. There are several generalizations of
derangements in the literature. Eriksen, Freij and Wätlund recently have studied derangements
with descents in given positions and ask what can be said for derangements with ascents,
instead of descents, in given positions. This presentation deals with derangements which
have ascents in predetermined positions. Moreover, we can prescribe the positions of ascents
and descents.
Videos
Home > Activities > Outputs > Videos
Title 
