Upper bounds for stabbing simplices by a line

01/03/2020
by   Inbar Daum-Sadon, et al.
0

It is known that for every dimension d> 2 and every k<d there exists a constant c_d,k>0 such that for every n-point set X⊂R^d there exists a k-flat that intersects at least c_d,k n^d+1-k - o(n^d+1-k) of the (d-k)-dimensional simplices spanned by X. However, the optimal values of the constants c_d,k are mostly unknown. The case k=0 (stabbing by a point) has received a great deal of attention. In this paper we focus on the case k=1 (stabbing by a line). Specifically, we try to determine the upper bounds yielded by two point sets, known as the "stretched grid" and the "stretched diagonal". Even though the calculations are independent of n, they are still very complicated, so we resort to analytical and numerical software methods. Surprisingly, for d=4,5,6 the stretched grid yields better bounds than the stretched diagonal (unlike for all cases k=0 and for the case (d,k)=(3,1), in which both point sets yield the same bound). The stretched grid yields c_4,1≤ 0.00457936, c_5,1≤ 0.000405335, and c_6,1≤ 0.0000291323.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2018

Optimal strategies for patrolling fences

A classical multi-agent fence patrolling problem asks: What is the maxim...
research
06/18/2020

No projective 16-divisible binary linear code of length 131 exists

We show that no projective 16-divisible binary linear code of length 131...
research
08/18/2023

Anonymous Refugee Housing with Upper-Bounds

Knop and Schierreich [AAMAS '23] recently introduced a novel model of re...
research
06/21/2018

Coloring of the dth power of the face-centered cubic grid

The face-centered cubic grid is a three dimensional 12-regular infinite ...
research
07/09/2021

Constant Delay Lattice Train Schedules

The following geometric vehicle scheduling problem has been considered: ...
research
08/04/2023

Exact upper bound for copulas with a given diagonal section

We answer a 15-year-old open question about the exact upper bound for bi...

Please sign up or login with your details

Forgot password? Click here to reset