Sciweavers

98 search results - page 7 / 20
» The patterns of permutations
Sort
View
EJC
2008
13 years 9 months ago
Pattern classes of permutations via bijections between linearly ordered sets
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
Sophie Huczynska, Nikola Ruskuc
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 9 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
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
13 years 9 months ago
Prefix Exchanging and Pattern Avoidance by Involutions
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
Aaron D. Jaggard
COMBINATORICS
2002
77views more  COMBINATORICS 2002»
13 years 9 months ago
Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 3
William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. ...
IACR
2011
128views more  IACR 2011»
12 years 9 months ago
Fault-propagation Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PR
—This paper proposes a novel fault-propagation pattern based differential fault analysis method - FPP-DFA, and proves its feasibility on SPN structure block ciphers using bitwise...
Xin-jie Zhao, Tao Wang, Shi-ze Guo