Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three
Antonio Bernini, Luca Ferrari, Renzo Pinzani
Abstract
Open-access reader
Antonio Bernini, Luca Ferrari, Renzo Pinzani
Abstract
Open-access reader
The method we have applied in [4] to count pattern avoiding permutations is adapted to words. As an application, we enumerate several classes of words simultaneously avoiding two generalized patterns of length 3.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The method we have applied in [4] to count pattern avoiding permutations is adapted to words. As an application, we enumerate several classes of words simultaneously avoiding two generalized patterns of length 3.
Key concepts: Enumeration, Mathematics, Combinatorics, Computer science