A counter-example to the theorem of Hiemer and Snurnikov
classification
🧮 math.DS
keywords
blockingfinitebilliardcounter-exampleeveryhiemerpointsproperty
read the original abstract
A planar polygonal billiard $\P$ is said to have the finite blocking property if for every pair $(O,A)$ of points in $\P$ there exists a finite number of ``blocking'' points $B_1, ..., B_n$ such that every billiard trajectory from $O$ to $A$ meets one of the $B_i$'s. As a counter-example to a theorem of Hiemer and Snurnikov, we construct a family of rational billiards that lack the finite blocking property.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.