Expected number of draws to obtain a soft streak
Let consecutive letters be drawn uniformly from the alphabet , and stop when a soft streak of length —that is, a non-decreasing word of length —is obtained. Let and be the quantities used in the preceding generating-function identities. Then the expected number of letters drawn is
and equivalently
Expected-number conjecture. The expected number of letters drawn is given by these two equivalent expressions.
This is presented as a corollary of the generating-function method and extends the preceding theorem for strictly increasing streaks to soft streaks. The supplied excerpt does not provide evidence that the conjecture has been resolved.
References
- Senan Sekhon, “Counting words without strictly increasing subwords of fixed length”, arXiv:2511.13287 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.