On the finite blocking property (Q2485445): Difference between revisions

A polygon is said to have the finite blocking property if every billiard orbit connecting two arbitrary points \(A\) and \(O\) on the boundary must intersect a finite set of boundary points. Such set depends on \(A\) and \(O\), but does not contain them. The author proves -- among other things -- that the only regular polygons having such property are the triangle, the square, and the hexagon. This definition extends to translation surfaces, for which some useful characterizations are derived.