Polya's Orchard Problem

DOI10.2307/2322700zbMath0601.52010OpenAlexW4243537186MaRDI QIDQ3736460

Thomas Tracy Allen

Publication date: 1986

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322700

zbMATH Keywords

visibilityinteger latticeOrchard problem of Polya and Szegö

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (7)

Visibility properties of spiral sets ⋮ Lattice Point Visibility on Generalized Lines of Sight ⋮ The forest hiding problem ⋮ The orchard visibility problem and some variants ⋮ Non-Euclidean visibility problems ⋮ On visibility problems with an infinite discrete set of obstacles ⋮ Rational approximation and arithmetic progressions

This page was built for publication: Polya's Orchard Problem