On the finite blocking property (Q2485445)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2191971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the finite blocking property |
scientific article; zbMATH DE number 2191971 |
Statements
On the finite blocking property (English)
0 references
4 August 2005
0 references
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.
0 references
blocking property
0 references
polygonal billiards
0 references
regular polygons
0 references
translation surfaces
0 references
Veech surfaces
0 references
torus branched covering
0 references
illumination
0 references
quadratic differentials
0 references
0 references
0 references
0 references
0.8395445346832275
0 references
0.8167913556098938
0 references
0.7979509830474854
0 references
0.7970798015594482
0 references
0.7825471758842468
0 references
