Annals of Combinatorics

, Volume 16, Issue 2, pp 253–269

Restricted Simsun Permutations

Article

DOI: 10.1007/s00026-012-0129-6

Cite this article as:
Deutsch, E. & Elizalde, S. Ann. Comb. (2012) 16: 253. doi:10.1007/s00026-012-0129-6
  • 107 Downloads

Abstract

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.

Mathematics Subject Classification

05A0505A15

Keywords

pattern avoidancesimsun permutationlattice pathgenerating tree

Copyright information

© Springer Basel AG 2012

Authors and Affiliations

  1. 1.Six MetroTech CenterPolytechnic Institute of New York University, New York UniversityBrooklynUSA
  2. 2.Department of MathematicsDartmouth CollegeHanoverUSA