 |
 |
Geometry |
|
Authors: Theophilus Agama
Using the method of compression we obtain a lower bound for the average number of $d^r$-unit distances that can be formed from a set of $n$ points in the euclidean space $\mathbb{R}^k$. By letting $\mathcal{D}_{n,d^r}$ denotes the number of $d^r$-unit distances~($r>1$~fixed) that can be formed from a set of $n$ points in $\mathbb{R}^k$, then we obtain the lower bound \begin{align} \sum \limits_{1\leq d\leq t}\mathcal{D}_{n,d^r}\gg n\sqrt[2r]{k}\log t.\nonumber \end{align}for a fixed $t>1$.
Comments: 7 Pages.
Download: PDF
[v1] 2022-05-02 20:43:02
Unique-IP document downloads: 265 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|