Polya's Orchard Problem

DOI10.2307/2322700MaRDI QIDQ3736460zbMATH OpenOpenAlexFDO

Authors 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

integer latticeOrchard problem of Polya and Szegövisibility

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1555476
• The orchard visibility problem and some variants
• scientific article; zbMATH DE number 2016910
• scientific article; zbMATH DE number 64020
• Non-Euclidean visibility problems

Cited in

(8)

• On visibility problems with an infinite discrete set of obstacles
• Visibility properties of spiral sets
• scientific article; zbMATH DE number 1555476 (Why is no real title available?)
• Lattice point visibility on generalized lines of sight
• Rational approximation and arithmetic progressions
• The forest hiding problem
• The orchard visibility problem and some variants
• Non-Euclidean visibility problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736460)