On Simsun and double Simsun permutations avoiding a pattern of length three

DOI10.3233/FI-2012-693MaRDI QIDQ2898452zbMATH OpenFDO

Authors Wan-Chen Chuang, Sen-Peng Eu, Tung-Shan Fu, Yeh-Jong Pan

Publication date 11 July 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

double-Simsunincreasing 1-2 treepattern-avoidingSimsun permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: A permutation $sigmainmathfrak{S}_n$ is simsun if for all $k$, the subword of $sigma$ restricted to $1,\mathrm{...},k$ does not have three consecutive decreasing elements. The permutation $sigma$ is double simsun if both $sigma$ and $sigm{a}^{-1}$ are simsun. In this paper we present a new bijection between simsun permutations and increasing 1-2 trees, and show a number of interesting consequences of this bijection in the enumeration of pattern-avoiding simsun and double simsun permutations. We also enumerate the double simsun permutations that avoid each pattern of length three.

Recommendations

• Permutations avoiding a simsun pattern
• Restricted simsun permutations
• Counting permutations by simsun successions
• A refined sign-balance of simsun permutations
• A generalization of Simion-Schmidt's bijection for restricted permutations

Cited in

(7)

• Restricted simsun permutations
• Permutations avoiding a simsun pattern
• More bijections for Entringer and Arnold families
• Counting permutations by simsun successions
• A refined sign-balance of simsun permutations
• The peak statistics on simsun permutations
• Crossings over permutations avoiding some pairs of patterns of length three

This page was built for publication: On Simsun and double Simsun permutations avoiding a pattern of length three

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