Recurrence relations in counting the pattern 13-2 in flattened permutations
classification
🧮 math.CO
keywords
flattenednumberpatternpermutationsrecurrencerelationscountingfunction
read the original abstract
We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.