Polylogarithmic Full-Chord Buffon Discrepancy
Statement
Steinerberger introduced the Buffon discrepancy problem, asking how accurately a one-dimensional set of length in a convex body can match the Crofton-predicted line-intersection counts, and proved an upper bound via a Steinhaus longimeter construction. His third open question asks whether restricting to sets built from full chords - intersections of lines with , the class containing every Steinhaus set - fundamentally changes the problem.
It does. Using the Aistleitner-Bilyk-Nikolov star-discrepancy theorem for arbitrary measures, full-chord constructions with discrepancy are shown to exist for every compact convex body with finite piecewise boundary. In the disk, every full-chord construction is shown to have discrepancy at least , via Schmidt's two-dimensional rectangle lower bound - where Steinerberger's concentric-circle construction, which is not full-chord, achieves discrepancy at most .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.