Timeline for Lower bounds for pattern complexity of aperiodic subshifts
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2022 at 8:54 | comment | added | Keen-ameteur | Okay, I guess I'm not sure about what I am reading without it being stated very explicitly. Thank you very much again. | |
| Nov 11, 2022 at 8:48 | vote | accept | Keen-ameteur | ||
| Nov 11, 2022 at 8:48 | comment | added | Ville Salo | Yes, Cassaigne precisely disproves the conjecture of Lagarias and Pleasants. "Our goal is to further improve it to obtain $\lim_n \frac{P(n)}{n^d} = 0$ [where $P(n) = c_n(x)$], and thus disprove the above conjecture [of Lagarias and Pleasants]." | |
| Nov 11, 2022 at 8:46 | comment | added | Keen-ameteur | Thank you for your answer, this is exactly the sort of thing I was looking for. Does this theorem show that the conjecture by Lagarias and Pleasents is false, by taking $f= o(n^{d-2})$? In the slides you linked to the function was just real valued, which would allow this. But since he doesn't explicitly state this, I am assuming that this is not true. | |
| Nov 11, 2022 at 7:40 | history | edited | Ville Salo | CC BY-SA 4.0 |
added 82 characters in body
|
| Nov 11, 2022 at 5:10 | history | answered | Ville Salo | CC BY-SA 4.0 |