Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The total run length of a word (1301.6568v2)

Published 28 Jan 2013 in math.CO and cs.DM

Abstract: A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length $n$. A number of associated problems have also been investigated. In this paper we consider a new variation on the theme. We say that the total run length (TRL) of a word is the sum of the lengths of the runs in the word and that $\tau(n)$ is the maximum TRL over all words of length $n$. We show that $n2/8 < \tau(n) < 47n2/72 + 2n$ for all $n$. We also give a formula for the average total run length of words of length $n$ over an alphabet of size $\alpha$, and some other results.

Citations (5)

Summary

We haven't generated a summary for this paper yet.