Sciweavers

72 search results - page 3 / 15
» Permutations Avoiding Two Patterns of Length Three
Sort
View
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 5 months ago
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
Richard Arratia
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
13 years 5 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
ARSCOM
2005
61views more  ARSCOM 2005»
13 years 5 months ago
On multi-avoidance of generalized patterns
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In thre...
Sergey Kitaev, Toufik Mansour
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 5 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
JCT
2010
117views more  JCT 2010»
13 years 3 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...