Sciweavers

Share
29 search results - page 1 / 6
» Counting 1324-Avoiding Permutations
Sort
View
COMBINATORICS
2002
105views more  COMBINATORICS 2002»
11 years 1 months ago
Counting 1324-Avoiding Permutations
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program pr...
Darko Marinov, Rados Radoicic
JCT
2008
77views more  JCT 2008»
11 years 1 months ago
Counting descent pairs with prescribed tops and bottoms
Given sets X and Y of positive integers and a permutation = 12
John T. Hall, Jeffrey B. Remmel
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
11 years 8 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
IANDC
2008
76views more  IANDC 2008»
11 years 1 months ago
The number of convex permutominoes
Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this ...
Paolo Boldi, Violetta Lonati, Roberto Radicioni, M...
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
11 years 1 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
books