Counting occurrences of 231 in an involution

DOI10.1016/J.DISC.2006.01.011MaRDI QIDQ2488929zbMATH OpenOpenAlexFDO

Authors Toufik Mansour, Sherry H. F. Yan, Laura L. M. Yang

Publication date 16 May 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.01.011

zbMATH Keywords

Generating functionsRestricted involutionsRestricted permutations

Mathematics Subject Classification ID

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

Recommendations

• Counting occurrences of 132 in an even permutation
• Restricted 123-involutions
• Some statistics on restricted 132 involutions
• Bivariate generating functions for involutions restricted by 3412
• scientific article; zbMATH DE number 2108134

Cites work

• Bivariate generating functions for involutions restricted by 3412
• Classification of forbidden subsequences of length 4
• Counting occurrences of 132 in a permutation
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Forbidden subsequences
• Forbidden subsequences and Chebyshev polynomials
• Generating trees and the Catalan and Schröder numbers
• scientific article; zbMATH DE number 2108134 (Why is no real title available?)
• On the number of permutations avoiding a given pattern
• Permutations with one or two 132-subsequences
• Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
• Restricted permutations
• Restricted permutations
• Restricted permutations, continued fractions, and Chebyshev polynomials
• Some statistics on restricted 132 involutions
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• The number of permutations containing exactly one increasing subsequence of length three
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!

Cited in

(8)

• Subsequence containment by involutions
• Counting occurrences of 132 in an even permutation
• Decomposing simple permutations, with enumerative consequences
• Counting subwords in flattened involutions and Kummer functions
• scientific article; zbMATH DE number 2108134 (Why is no real title available?)
• Involutions containing exactly r pairs of intersecting arcs
• Counting covered fixed points and covered arcs in an involution
• Symmetric permutations avoiding two patterns

This page was built for publication: Counting occurrences of 231 in an involution

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