Sciweavers

98 search results - page 1 / 20
» The patterns of permutations
Sort
View
EJC
2010
13 years 5 months ago
Packing sets of patterns
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
Alexander Burstein, Peter Hästö
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
13 years 4 months ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
DM
2008
97views more  DM 2008»
13 years 5 months ago
On uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
Sergey V. Avgustinovich, Sergey Kitaev
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 5 months ago
Longest Common Pattern between two Permutations
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
Dominique Rossin, Mathilde Bouvel
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 4 months ago
Longest Common Separable Pattern between Permutations
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
Mathilde Bouvel, Dominique Rossin, Stéphane...