Skip to main content
Log in

Blocking of billiard orbits and security for polygons and flat surfaces

  • Original Paper
  • Published:
Geometric & Functional Analysis GAFA Aims and scope Submit manuscript

Abstract.

We introduce and study the notion of security for polygons and flat surfaces. Let P be one. For x, y ∈ P let G(x, y) be the set of geodesics connecting x and y. We say that P is secure if for any x, y ∈ P all geodesics in G(x, y) can be blocked by a finite set B ⊂ P. We prove, in particular, that a lattice polygon is secure iff it is arithmetic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. Gutkin.

Additional information

Received: September 2003 Revision: March 2004 Accepted: March 2004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gutkin, E. Blocking of billiard orbits and security for polygons and flat surfaces. GAFA, Geom. funct. anal. 15, 83–105 (2005). https://doi.org/10.1007/s00039-005-0502-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00039-005-0502-2

Keywords

Navigation