Sciweavers

15 search results - page 1 / 3
» Shape-Wilf-Ordering on Permutations of Length 3
Sort
View
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 4 months ago
Shape-Wilf-Ordering on Permutations of Length 3
Zvezdelina Stankova
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
13 years 4 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
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
13 years 4 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson
DM
2006
91views more  DM 2006»
13 years 4 months ago
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
Alexander Burstein, Sergi Elizalde, Toufik Mansour
ACISP
2000
Springer
13 years 9 months ago
Cryptanalysis of the m-Permutation Protection Schemes
Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP'98, Fung and Gray proposed an −m permutation protecti...
Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng