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

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

2007-11-21

arxiv.org/abs/0711.3387v1

Mathematics

Combinatorics

18 pages, 13 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Enumeration of some classes of words avoiding two generalized patterns of length three does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of some classes of words avoiding two generalized patterns of length three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of some classes of words avoiding two generalized patterns of length three will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414613