Timeline for $\omega$-de-Bruijn sequences
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27 at 19:02 | vote | accept | Dominic van der Zypen | ||
| Oct 27 at 10:14 | answer | added | te4 | timeline score: 5 | |
| Oct 27 at 9:00 | comment | added | Dominic van der Zypen | Nice, can you post this as an answer so we can close this thread? | |
| Oct 26 at 22:36 | comment | added | te4 | There is. Order $\omega^n$ lexicographically. Start with $n$ zeros. At $k$-th step choose the least $v\in\omega^n$ that hasn't been used. Add $n$ pairwise different symbols that haven't appeared yet to the existing word (separators). Build $v$ after separators. Go to step $k+1$ | |
| Oct 26 at 20:26 | comment | added | Claude Chaunier | I think $n=2$ works with $b_2 := 010212031323041424340515253545061\dots$ | |
| Oct 26 at 18:50 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |