Counting occurrences of patterns in permutations

DOI10.37236/12963MaRDI QIDQ7035580zbMATH OpenFDO

Authors Andrew R. Conway, Anthony J Guttmann

Publication date 29 January 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12963

zbMATH Keywords

\(r\)-occurrenceWilf classes

Mathematics Subject Classification ID

Computational methods for problems pertaining to combinatorics (05-08) Research data for problems pertaining to combinatorics (05-11) Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites work

• 1324-avoiding permutations revisited
• DD: a new decision diagram for efficient problem solving in permutation space
• A Central Limit Theorem for Vincular Permutation Patterns
• Approaches for enumerating permutations with a prescribed number of occurrences of patterns
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• Counting occurrences of 132 in a permutation
• Decomposing simple permutations, with enumerative consequences
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• On three different notions of monotone subsequences
• Pattern frequency sequences and internal zeros
• Permutations with one or two 132-subsequences
• Series extension: predicting approximate series coefficients from a finite number of exact coefficients
• Stieltjes moment sequences for pattern-avoiding permutations
• Symmetric functions and P-recursiveness
• The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
• 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!
• Using functional equations to enumerate 1324-avoiding permutations
• Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
• Words in linear groups, random walks, automata and P-recursiveness

This page was built for publication: Counting occurrences of patterns in permutations

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