On the length of word chains (Q1108812): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the length of word chains |
scientific article |
Statements
On the length of word chains (English)
0 references
1987
0 references
Word chains are an extension of addition chains to words. We show that over a q-letter alphabet, any long enough word admits a word chain of length at most \((1+\epsilon)n/\log_ q n\), for a fixed arbitrary \(\epsilon >0\); there exist words with no chain shorter than \(n/\log_{q- 1} n\). Several examples are given. Finally, we show that words with few factors have short chains.
0 references
D0L-systems
0 references
addition chains
0 references
word chain
0 references
