activity
19992005
most citedAvoiding 2-letter signed patterns

24 citations · 93 across the 24 of their papers we have counts for

collaborators
Showing 2001Show all

10 papers · 1 filter

math.CO2001

Words restricted by 3-letter generalized multipermutation patterns

Alexander Burstein, Toufik Mansour

We find exact formulas and/or generating functions for the number of words avoiding 3-letter generalized multipermutation patterns and find which of them are equally avoided.

math.CO2001

Coloured permutations containing and avoiding certain patterns

T. Mansour

Following Mansour, let be the set of all coloured permutations on the symbols with colours , which is the analogous of the symmetric group when r…

math.CO2001

Continued fractions, statistics, and generalized patterns

T. Mansour

Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent i…

math.CO2001

Continued fractions and generalized patterns

T. Mansour

In [BS] Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation.…

math.CO2001

Words restricted by patterns with at most 2 distinct letters

Alexander Burstein, Toufik Mansour

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…

math.CO2001

restricted 1-3-2 permutations and generalized patterns

T. Mansour

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the…