14 search results - page 2 / 3 » Binary Words Containing Infinitely Many Overlaps |
COMBINATORICS
2002
13 years 4 months ago
2002
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
DCG
2006
13 years 4 months ago
2006
Let B be a Borel set in Ed with volume V (B) = . It is shown that almost all lattices L in Ed contain infinitely many pairwise disjoint d-tuples, that is sets of d linearly indepen...
SIAMDM
2008
13 years 4 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
TOIS
2002
13 years 4 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
The aim of this paper is to present a construction of t-divisible designs for t > 3, because such divisible designs seem to be missing in the literature. To this end, tools suc...