On the number of antipodal or strictly antipodal pairs of points in finite subsets of Rd, III
Abstract
We improve our earlier upper bound on the numbers of antipodal pairs of points among n points in R3, to 2n2/5+O(nc), for some c<2. We prove that the minimal number of antipodal pairs among n points in convex position in Rd, affinely spanning Rd, is n + d(d - 1)/2 - 1. Let sasd(n) be the minimum of the number of strictly antipodal pairs of points among any n points in Rd, with affine hull Rd, and in strictly convex position. The value of sasd(n) was known for d 3 and any n. Moreover, sasd(n) = n/2 was known for n 2d even, and n 4d+1 odd. We show sasd(n) = 2d for 2d+1 n 4d-1 odd, we determine sasd(n) for d=4 and any n, and prove sasd(2d -1) = 3(d - 1). The cases d 5 and d+2 n 2d - 2 remain open, but we give a lower and an upper bound on sasd(n) for them, which are of the same order of magnitude, namely ( (d-k)d ) . We present a simple example of a strictly antipodal set in Rd, of cardinality const\,· 1.5874...d. We give simple proofs of the following statements: if n segments in R3 are pairwise antipodal, or strictly antipodal, then n 4, or n 3, respectively, and these are sharp. We describe also the cases of equality.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.