7 search results - page 1 / 2 » Exponential lower bounds for the number of words of uniform ... |
IANDC
2007
13 years 7 months ago
2007
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
CCA
2000
Springer
13 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
SIAMCOMP
2002
13 years 7 months ago
2002
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...