Given an integer d ⩾ 2 d 2, s ∈ (0, 1 ] s (0, 1], and t ∈ 0, 2 (d − 1) t 0, 2 (d-1), suppose a set X X in R d Rᵈ has the following property: there is a collection of lines of packing dimension t t such that every line from the collection intersects X X in a set of packing dimension at least s s. We show that such sets must have packing dimension at least max s, t / 2 \s, t/2\ and that this bound is sharp. In particular, the special case d = 2 d=2 solves a variant of the Furstenberg set problem for packing dimension. We also solve the upper and lower box dimension variants of the problem. In both of these cases the sharp threshold is max s, t + 1 − d \s, t+1-d\.
Jonathan M. Fraser (Wed,) studied this question.