Generating-tree isomorphisms for pattern-avoiding involutions

DOI10.1007/s00026-011-0101-xzbMath1233.05013OpenAlexW1984007184MaRDI QIDQ659648

Joseph J. Marincel, Aaron D. Jaggard

Publication date: 24 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00026-011-0101-x

zbMATH Keywords

involutionpermutation patterngenerating tree

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method

Cites Work

• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Symmetric functions and P-recursiveness
• Standard Young tableaux of height 4 and 5
• Prefix exchanging and pattern avoidance by involutions
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Vexillary involutions are enumerated by Motzkin numbers
• Asymptotic values for degrees associated with strips of Young diagrams
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• New equivalences for pattern avoiding involutions
• Restricted permutations

This page was built for publication: Generating-tree isomorphisms for pattern-avoiding involutions