Timeline for Covering sequences of words
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 2, 2017 at 15:39 | vote | accept | DavidHume | ||
S Feb 25, 2017 at 2:41 | history | suggested | JRN |
added a tag
|
|
Feb 25, 2017 at 2:23 | review | Suggested edits | |||
S Feb 25, 2017 at 2:41 | |||||
Feb 24, 2017 at 17:16 | answer | added | D. Ror. | timeline score: 3 | |
Feb 21, 2017 at 19:33 | comment | added | Gerhard Paseman | Do an interleaving of sequences with repetition. Suppose you have a sequence of words that works and gives you nice alphas below n, all of value > 1/n, and you want alpha_n to be less than 1/n. Insert a^nb^(n^2) into your sequence at every nth position. Gerhard "Is Feeling Very Sketchy Today" Paseman, 2017.02.21. | |
Feb 21, 2017 at 19:31 | history | edited | DavidHume | CC BY-SA 3.0 |
edited tags
|
Feb 21, 2017 at 17:23 | history | asked | DavidHume | CC BY-SA 3.0 |