134 search results - page 17 / 27 » Combinatorics of diagrams of permutations |
MST
2006
13 years 9 months ago
2006
Abstract. Many researchers have had fun searching for and rendering symmetric Venn diagrams, culminating in the recent result of Griggs, Killian, and Savage ("Venn Diagrams an...
COCOON
2010
Springer
13 years 8 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
CPM
2009
Springer
13 years 7 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
COMBINATORICS
2006
13 years 9 months ago
2006
Let h, e, and m denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric function associated with the partition respectively. We gi...
COMBINATORICS
2006
13 years 9 months ago
2006
We define incidence matrices to be zero-one matrices with no zero rows or columns. We are interested in counting incidence matrices with a given number of ones, irrespective of th...