Counting occurrences of 3412 in an involution
classification
🧮 math.CO
keywords
functioninvolutionslettersoccurrencesamountscheckcontainingcounting
read the original abstract
We study the generating function for the number of involutions on $n$ letters containing exactly $r\gs0$ occurrences of 3412. It is shown that finding this function for a given $r$ amounts to a routine check of all involutions on $2r+1$ letters.
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.