Words restricted by patterns with at most 2 distinct letters
classification
🧮 math.CO
keywords
patternswordsavoidingcertaindistinctfindlettersnumber
read the original abstract
We find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain patterns and provide bijective proofs for the resulting formulas.
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.