Sciweavers

72 search results - page 1 / 15
» Permutations Avoiding Two Patterns of Length Three
Sort
View
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
13 years 4 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 4 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
DM
2008
61views more  DM 2008»
13 years 4 months ago
Wilf classification of three and four letter signed patterns
We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern a...
W. M. B. Dukes, Toufik Mansour, Astrid Reifegerste
DM
2007
83views more  DM 2007»
13 years 4 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge