1. A note on the complexity of -words
- Author
-
Huang, Yun Bao and Weakley, William D.
- Subjects
- *
COMPUTATIONAL complexity , *MATHEMATICAL sequences , *MATHEMATICAL constants , *INTEGER programming , *REAL numbers , *MATHEMATICAL analysis - Abstract
Abstract: Let be the number of -words of length . Say that a -word is left doubly extendable (LDE) if both and are . We show that for any positive real number and positive integer such that the proportion of 2’s is greater than in each LDE word of length exceeding , there are positive constants and such that for all positive integers . With the best value known for , and large , this gives [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF