Timeline for Maximal chain of 1s in binary strings
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2013 at 23:07 | comment | added | Douglas Zare | @Noah Stein: There is often some dependence on the fractional part of $\log_2 n$ in problems where $n$ might behave like $n/2$, but there could be some sort of transition between $n/2$ and $n$. The fluctuations between $n/2$ and $n$ may not die out. This happens in trie-theory (some restricted binary trees, see Flajolet and Sedgewick) and in problems like mathoverflow.net/questions/11255/…. Schilling's papers confirm the dependence on the fractional part of $\log_2 n$ both for the mean and variance. | |
| Mar 28, 2013 at 19:25 | comment | added | Noah Stein | Interesting. Do you have a feel for an intuitive reason that the fractional part of $\log_2 n$ should have anything to do with it for large $n$? | |
| Mar 28, 2013 at 15:20 | history | answered | Douglas Zare | CC BY-SA 3.0 |