Timeline for Are there arbitrarily long arithmetic progressions in every increasing sequence of positive integers with bounded gaps between consecutive terms?
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2022 at 12:22 | comment | added | Gerry Myerson | My opinion: yes, better to ask a new question. Be sure to link each of the two questions to each other. | |
| Nov 7, 2022 at 12:18 | comment | added | Kai Wang | @GerryMyerson Is it better to start a new question? I edited the existing one because the two questions are so similar but the answers are different. | |
| Nov 6, 2022 at 9:28 | comment | added | Gerry Myerson | Probably not a good idea to edit in a new question several months after you have accepted an answer to the original question. | |
| Nov 6, 2022 at 0:23 | history | edited | Kai Wang | CC BY-SA 4.0 |
added 155 characters in body
|
| Oct 4, 2021 at 14:13 | vote | accept | Kai Wang | ||
| Oct 2, 2021 at 12:01 | comment | added | GH from MO | Yes, I meant "closed in a good sense". Like "case closed". I think the question was fine for this site, even though to combinatorics experts it was probably rather standard. | |
| Oct 2, 2021 at 9:32 | comment | added | Fedor Petrov | @GerryMyerson closed in good sense:) | |
| Oct 2, 2021 at 5:48 | comment | added | Gerry Myerson | @GHfromMO, usually we close a question so that it cannot be answered. It seems odd to answer a question so that it can be closed. | |
| Oct 1, 2021 at 21:30 | history | became hot network question | |||
| Oct 1, 2021 at 19:37 | comment | added | Fedor Petrov | @GHfromMO ok, done | |
| Oct 1, 2021 at 19:36 | answer | added | Fedor Petrov | timeline score: 9 | |
| Oct 1, 2021 at 16:01 | review | Close votes | |||
| Oct 6, 2021 at 3:11 | |||||
| Oct 1, 2021 at 14:32 | comment | added | GH from MO | @FedorPetrov I suggest that you turn your comment into an answer so that this question can be closed. | |
| Oct 1, 2021 at 14:01 | comment | added | Fedor Petrov | If the gaps are bounded, say by $T$, a much easier Van der Varden theorem also helps: color $n$ to color $i\in \{1,\ldots,T\} $ if $nT+i$ belongs to your set and find a large monochromatic progression. | |
| Oct 1, 2021 at 13:40 | comment | added | Alexander Kalmynin | Your set has positive density, hence Szemerédi's theorem applies, see en.wikipedia.org/wiki/Szemer%C3%A9di%27s_theorem | |
| S Oct 1, 2021 at 13:30 | review | First questions | |||
| Oct 1, 2021 at 13:58 | |||||
| S Oct 1, 2021 at 13:30 | history | asked | Kai Wang | CC BY-SA 4.0 |