Counting occurrences of some subword patterns
classification
🧮 math.CO
keywords
numberoccurrencessubwordcontainingfindfunctionsgeneratingpatterns
read the original abstract
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
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.