1732 search results - page 46 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
159
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
175
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
124
click to vote
EJC
2008
15 years 6 months ago
2008
Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
112
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness gua...
173
click to vote
TAMC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...