Enumeration of some classes of words avoiding two generalized patterns of length three

From MaRDI portal
Publication:3589631



Abstract: The method we have applied in "A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162" 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.






Describes a project that uses

Uses Software






This page was built for publication: Enumeration of some classes of words avoiding two generalized patterns of length three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589631)