Abstract
For any integersn, d ≥ 2, letП(n, d) be the largest number such that every setP ofn points inRd contains two pointsx, y ∈ P satisfying |boxd(x, y) ∩ P| ≥П(n, d), where boxd(x, y) means the smallest closed box with sides parallel to the axes, containingx andy. We show that, for any integersn,\(d \geqslant 2,\frac{2}{{(2\sqrt 2 )^{2^d } }}n + 2 \leqslant \prod (n,d) \leqslant \frac{2}{{7^{[d/5]} 2^{2^{d - 1} } }}n + 5\), which improves the lower bound due to Grolmusz [9] by a short self-contained proof.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
