Counting occurrences of 132 in an even permutation

DOI10.1155/S0161171204304114zbMATH Open1063.05003arXivmath/0211205OpenAlexW2171119954MaRDI QIDQ1774751FDOQ1774751

Toufik Mansour

Publication date: 18 May 2005

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Abstract: We study the generating function for the number of even (or odd) permutations on n letters containing exactly $rgs0$ occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.

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

Recommendations

• Counting occurrences of 132 in a permutation
• Counting 1324-avoiding permutations
• Counting 1324, 4231-avoiding permutations
• Counting of even and odd restricted permutations
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
• scientific article
• Permutations with one or two 132-subsequences
• Recurrence relations in counting the pattern 13-2 in flattened permutations
• Counting occurrences of 231 in an involution

zbMATH Keywords

generating function

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Applications of graph theory (05C90) Exact enumeration problems, generating functions (05A15)

Cited In (5)

• Counting occurrences of 132 in a permutation
• Counting occurrences of 231 in an involution
• Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
• Decomposing simple permutations, with enumerative consequences

This page was built for publication: Counting occurrences of 132 in an even permutation

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