Timeline for All Integers from the Smallest Digit Stream with a Window Filter
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2014 at 20:11 | answer | added | The Masked Avenger | timeline score: 0 | |
| May 2, 2014 at 18:50 | answer | added | Nick Gill | timeline score: 1 | |
| Apr 30, 2014 at 21:32 | comment | added | bobuhito | yes, you understand it correctly | |
| Apr 30, 2014 at 15:27 | comment | added | Nick Gill | @bobuhito, When you say "all integers come out", do you just mean that you will get all $B^D$ integers of length $D$? I'm sure you must mean this, but I just want to check that I understand your question properly. | |
| Apr 29, 2014 at 19:00 | comment | added | Gerhard Paseman | Try writing the digits in a circle. If there are 4n many digits, try swapping every other diametrically opposed pair with itself. This suggests an alternate cycle which switches the window elements around. Gerhard "Likes To Mix Things Up" Paseman, 2014.04.29 | |
| Apr 29, 2014 at 18:48 | comment | added | bobuhito | I didn't know about DeBruijin. The answer is therefore yes, and, even more amazing, a contiguous window can always be used. So, that begs the question, can a stream be found for any given window? By your comment, I guess you extended my question to this already. Thanks. | |
| Apr 29, 2014 at 18:25 | comment | added | Gerhard Paseman | You might be interested in DeBruijn cycles and adaptations. In Debruijn cycles, the window is continguous of length D. Finding a permutation which preserves the DeBruijn property but changes the window might be of interest. Gerhard "Then Again, It Might Not" Paseman, 2014.04.29 | |
| Apr 29, 2014 at 16:40 | comment | added | bobuhito | This might be confusing because my digits in the example ranged from 1 to 3. It's more normal to use a range from 0 to 2, so subtract one from all digits if that makes it more intuitive. | |
| Apr 29, 2014 at 16:30 | history | asked | bobuhito | CC BY-SA 3.0 |