Sciweavers

134 search results - page 8 / 27
» Combinatorics of diagrams of permutations
Sort
View
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
13 years 9 months ago
Bijections for Hook Pair Identities
Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally foun...
Christian Krattenthaler
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
13 years 9 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
2006
147views more  COMBINATORICS 2006»
13 years 9 months ago
A Survey on Packing and Covering Problems in the Hamming Permutation Space
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...
Jörn Quistorff
COMBINATORICS
2006
83views more  COMBINATORICS 2006»
13 years 9 months ago
Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series
We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutati...
Murray Elder
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 9 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