Timeline for Partition theorems for located words
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2018 at 7:53 | vote | accept | Domenico Zambella | ||
| Aug 17, 2018 at 7:53 | comment | added | Domenico Zambella | Indeed a constant sequence produces a counter example. If I understand the definition correctly myself, you have to remain inside $W(\Sigma;v)$ i.e. words may not be constant. So the sequence such contain the word $vv$ and coloring should color words not containing the letter $b$ in red and everything else in blue. | |
| Aug 16, 2018 at 1:03 | history | answered | Pierre Simon | CC BY-SA 4.0 |