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

lattice pointsPick's theoremcircular forestproblem of G. Pólya

Mathematics Subject Classification ID

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

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)

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

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)