Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

Arithmetic Visibility in Polygons: Curved Sight in the Art Gallery

Abstract

In the classical art gallery problem, a guard sees a target when the segment joining them lies entirely within the polygon. We explore what changes when sight may bend along regular arcs on absolutely irreducible curves, but only those defined by primitive integer polynomials of total degree at most d and coefficient height at most H. We call such curves admissible sight carriers. Arcs can dramatically improve sight. In a one-sided comb, no straight-line guard sees selected targets in two different teeth, yet a single central guard sees a chosen target in every tooth along parabolic carriers. Sight can also fail in two different ways. Geometrically, the polygon may block every sight arc of the allowed degree between two points. For instance, in an alternating comb, the number of guards needed for a row of targets spanning the comb grows linearly with the number of sides at each fixed degree, even for carriers with arbitrary real coefficients. Arithmetically, no admissible carrier may pass through the points at all. Even in the unit square, at fixed d and H, the proportion of rational targets that must guard themselves tends to one as the height bound grows. An algebraic target may lie on no rational curve of degree at most d, however large H is. Both failures can be overcome for finite target sets by allowing the degree and coefficient height to grow. We show that every finite set of algebraic targets in a rational polygon becomes visible from any rational interior guard, with explicit bounds. We also construct, for every d, arbitrarily large Galois orbits in the unit square, all of projective height 4d+1, whose points must each guard themselves at degree d for every H. Yet at degree d+1 and coefficient height one, a single guard sees the whole orbit along Z(Y−Xd+1).

Related

  1. Isoperimetric Problems on cyclic polygons
    Abd Raouf Chouikha
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Triangulated polygons and Y-frieze patterns
    Hin Chung Henry Tsang, Jon Wilson
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. A Pick-type theorem for halfway-lattice polygons
    Charlene Chu, Yael Karshon
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  4. Tile sets consisting of two types of concave polygons derived from periodic tilings corresponding to non-periodic tilings with hat and turtle tiles
    Teruhisa Sugimoto
    arXivPreprintCC BY-NC-SA 4.0Full textGeometry & topologyarXiv
  5. An Affine Approach to Metric Invariants of Poncelet Polygons
    Mohammad Hassan Murad
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
BibTeX
@misc{barrett2026arithmetic,
  title = {{Arithmetic Visibility in Polygons: Curved Sight in the Art Gallery}},
  author = {Malik Barrett},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.19506},
  eprint = {2610.19506},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.19506},
}
RIS
TY  - UNPB
TI  - Arithmetic Visibility in Polygons: Curved Sight in the Art Gallery
AU  - Malik Barrett
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2610.19506
UR  - https://arxiv.org/abs/2610.19506
AB  - In the classical art gallery problem, a guard sees a target when the segment joining them lies entirely within the polygon. We explore what changes when sight may bend along regular arcs on absolutely irreducible curves, but only those defined by primitive integer polynomials of total degree at most d and coefficient height at most H. We call such curves admissible sight carriers. Arcs can dramatically improve sight. In a one-sided comb, no straight-line guard sees selected targets in two different teeth, yet a single central guard sees a chosen target in every tooth along parabolic carriers. Sight can also fail in two different ways. Geometrically, the polygon may block every sight arc of the allowed degree between two points. For instance, in an alternating comb, the number of guards needed for a row of targets spanning the comb grows linearly with the number of sides at each fixed degree, even for carriers with arbitrary real coefficients. Arithmetically, no admissible carrier may pass through the points at all. Even in the unit square, at fixed d and H, the proportion of rational targets that must guard themselves tends to one as the height bound grows. An algebraic target may lie on no rational curve of degree at most d, however large H is. Both failures can be overcome for finite target sets by allowing the degree and coefficient height to grow. We show that every finite set of algebraic targets in a rational polygon becomes visible from any rational interior guard, with explicit bounds. We also construct, for every d, arbitrarily large Galois orbits in the unit square, all of projective height 4^d+1, whose points must each guard themselves at degree d for every H. Yet at degree d+1 and coefficient height one, a single guard sees the whole orbit along Z(Y−X^d+1).
ER  -