scientific article; zbMATH DE number 1555476

MaRDI QIDQ4525543zbMATH OpenFDO

Authors Vladimir Janković

Publication date 23 January 2001

Full work available at URL https://eudml.org/doc/231252

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

circular forestlattice pointsPick's theoremproblem of G. Pólya

Mathematics Subject Classification ID

Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• Polya's Orchard Problem
• The orchard visibility problem and some variants
• How far can you see in a forest?
• The forest hiding problem
• Littlewood's one-circle problem, revisited

Cited in

(9)

• Visibility in the Boolean model
• Pólya's permanent problem
• scientific article; zbMATH DE number 5965157 (Why is no real title available?)
• A Problem of Pólya
• Polya's Orchard Problem
• Solution to a Problem of Goranko and Passy
• scientific article; zbMATH DE number 1941471 (Why is no real title available?)
• How far can you see in a forest?
• The orchard visibility problem and some variants

This page was built for publication:

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