Timeline for Counting the number of pair of d-uplets with upper bounded distance
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2022 at 10:32 | vote | accept | Ludwich | ||
| Dec 23, 2022 at 8:33 | comment | added | Ludwich | Thanks a lot for this idea @PeterTaylor , I think that it should be sufficient in my case ! | |
| Dec 22, 2022 at 22:05 | comment | added | Peter Taylor | If we assume that $k$ is sufficiently large, $c$ is sufficiently small, and $v$ is sufficiently far from the edges then we can ignore edge effects; this is equivalent to relaxing $\mathbb{N}^d$ to $\mathbb{Z}^d$, and works fine for upper bounding $|\{ u : (u - v) \cdot {\bf 1} = 0, |u - v|_1 \leq c \}| = \Theta(c^{d-1})$. | |
| Dec 22, 2022 at 21:38 | answer | added | Bruno Seefeld | timeline score: 2 | |
| Dec 22, 2022 at 16:27 | history | edited | Ludwich | CC BY-SA 4.0 |
edited body
|
| Dec 22, 2022 at 15:20 | history | asked | Ludwich | CC BY-SA 4.0 |