Timeline for Number of orders of distances between points on a line
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2020 at 17:30 | history | edited | YCor |
edited tags
|
|
| Feb 21, 2020 at 2:56 | comment | added | Arseniy Akopyan | Yes, thanks for the ref. I do not understand why it could be the same. But I am busy on that week and will look on it later | |
| Feb 20, 2020 at 4:14 | comment | added | Gerry Myerson | Have you had a look at that link, Arseniy? | |
| Feb 17, 2020 at 22:12 | comment | added | Gerry Myerson | Is it by any chance oeis.org/A004123 ? | |
| Feb 17, 2020 at 3:24 | comment | added | Fedor Petrov | immediate upper estimate is like $n^{3n+o(n)}$, is it ok for you? | |
| Feb 16, 2020 at 15:00 | comment | added | Arseniy Akopyan | @FedorPetrov, what about the asymptotic? | |
| Feb 16, 2020 at 14:59 | comment | added | Arseniy Akopyan | @GerryMyerson, I will try if I found how to program it. | |
| Feb 15, 2020 at 22:04 | comment | added | Gerry Myerson | Can you do it for a few small values of $n$, Arseniy, and then consult the Online Encyclopedia of Integer Sequences? | |
| Feb 15, 2020 at 16:17 | comment | added | Fedor Petrov | In other words, you want to count the number of regions in the hyperplane arrangement $\{x_i-x_j,x_i+x_j-x_k-x_l\}$ (and divide it by $n!$). I doubt that a formula exists. | |
| Feb 15, 2020 at 15:08 | history | asked | Arseniy Akopyan | CC BY-SA 4.0 |