Restricted simsun permutations

Details Restricted simsun permutations Restricted simsun permutations

2009-12-07

arxiv.org/abs/0912.1361v1

Mathematics

Combinatorics

21 pages, 10 figures

Scientific paper

A permutation is simsun if for all k, the subword of the one-line notation consisting of the k smallest entries does not have three consecutive decreasing elements. Simsun permutations were introduced by Simion and Sundaram, who showed that they are counted by the Euler numbers. In this paper we enumerate simsun permutations avoiding a pattern or a set of patterns of length 3. The results involve Motkzin, Fibonacci, and secondary structure numbers. The techniques in the proofs include generating functions, bijections into lattice paths and generating trees.

Affiliated with

Also associated with

No associations

Rating

Restricted simsun 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 simsun permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted simsun permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-385151