2007•arXiv (Cornell University)Open access

Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three

Antonio Bernini, Luca Ferrari, Renzo Pinzani

Open full text 3 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three — Research Paper | ScholarLens