Sciweavers

1215 search results - page 61 / 243
» Combinatorics
Sort
View
TCS
2008
15 years 3 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 3 months ago
Plethysm for Wreath Products and Homology of Sub-Posets of Dowling Lattices
We prove analogues for sub-posets of the Dowling lattices of the results of Calderbank, Hanlon, and Robinson on homology of sub-posets of the partition lattices. The technical too...
Anthony Henderson
COMBINATORICS
2006
110views more  COMBINATORICS 2006»
15 years 3 months ago
Jamming and Geometric Representations of Graphs
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
Werner Krauth, Martin Loebl
COMBINATORICS
2006
147views more  COMBINATORICS 2006»
15 years 3 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
98
Voted
COMBINATORICS
2006
141views more  COMBINATORICS 2006»
15 years 3 months ago
Binary Words Containing Infinitely Many Overlaps
We characterize the squares occurring in infinite overlap-free binary words and construct various power-free binary words containing infinitely many overlaps.
James D. Currie, Narad Rampersad, Jeffrey Shallit