Papers
Topics
Authors
Recent
Search
2000 character limit reached

Number of double-normal pairs in space

Published 14 Dec 2014 in math.CO, cs.DM, and math.MG | (1412.4405v2)

Abstract: Given a set VV of points in R<sup>d\mathbb R<sup>d, two points pp, qq from VV form a double-normal pair, if the set VV lies between two parallel hyperplanes that pass through pp and qq, respectively, and that are orthogonal to the segment pqpq. In this paper we study the maximum number Nd(n)N_d(n) of double-normal pairs in a set of nn points in R<sup>d\mathbb R<sup>d. It is not difficult to get from the famous Erd\H{o}s-Stone theorem that Nd(n)=12(11/k)n<sup>2+o(n<sup>2)N_d(n) = \frac 12(1-1/k)n<sup>2+o(n<sup>2) for a suitable integer k=k(d)k = k(d) and it was shown in the paper by J. Pach and K. Swanepoel that d/2k(d)d1\lceil d/2\rceil\le k(d)\le d-1 and that asymptotically k(d)dO(logd)k(d)\gtrsim d-O(\log d). In this paper we sharpen the upper bound on k(d)k(d), which, in particular, gives k(4)=2k(4)=2 and k(5)=3k(5)=3 in addition to the equality k(3)=2k(3)=2 established by J. Pach and K. Swanepoel. Asymptotically we get k(d)dlog2k(d)=d(1+o(1))log2k(d)k(d)\le d- \log_2k(d) = d - (1+ o(1)) \log_2k(d) and show that this problem is connected with the problem of determining the maximum number of points in R<sup>d\mathbb R<sup>d that form pairwise acute (or non-obtuse) angles.

Authors (1)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.