Restricted simsun permutations

DOI10.1007/S00026-012-0129-6MaRDI QIDQ1928580zbMATH OpenOpenAlexWikidataFDO

Authors Emeric Deutsch, Sergi Elizalde

Publication date 3 January 2013

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0912.1361

zbMATH Keywords

generating treelattice pathpattern avoidancesimsun permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

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.

Recommendations

• On Simsun and double Simsun permutations avoiding a pattern of length three
• Permutations avoiding a simsun pattern
• Counting permutations by simsun successions
• Counting simsun permutations by descents
• The peak statistics on simsun permutations

Cites work

• A survey of alternating permutations
• An algebraic characterization of the set of succession rules
• Automorphisms on Catalan trees and bracketings
• Bijections for refined restricted permutations
• Counting simsun permutations by descents
• Generalized permutation patterns and a classification of the Mahonian statistics
• Generating trees and forbidden subsequences
• scientific article; zbMATH DE number 3425611 (Why is no real title available?)
• scientific article; zbMATH DE number 1431596 (Why is no real title available?)
• On some new sequences generalizing the Catalan and Motzkin numbers
• On the \(cd\)-variation polynomials of André and Simsun permutations
• Pattern avoidance in alternating permutations and tableaux (extended abstract)
• Permutation trees and variation statistics
• Permutations with restricted patterns and Dyck paths
• Production matrices
• Restricted 132-alternating permutations and Chebyshev polynomials
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Restricted permutations
• The homology representations of the symmetric group on Cohen-Macaulay subposets of the partition lattice
• The On-Line Encyclopedia of Integer Sequences

Cited in

(5)

• Permutations avoiding a simsun pattern
• Counting permutations by simsun successions
• A refined sign-balance of simsun permutations
• The peak statistics on simsun permutations
• On Simsun and double Simsun permutations avoiding a pattern of length three

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Restricted simsun permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928580)