The thinnest holding-lattice of a set

DOI10.1007/BF01364338MaRDI QIDQ578593zbMATH OpenOpenAlexFDO

Authors Károly Bezdek

Publication date 1987

Published in Monatshefte für Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

densityregular triangle-latticethinnest holding-lattice

Mathematics Subject Classification ID

Random convex sets and integral geometry (aspects of convex geometry) (52A22) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Review text

We study the following question proposed by F. Fejes Tóth in personal communication. In the Euclidean plane a lattice \(\Gamma\) is called a holding-lattice of a planar set S if any set congruent to S contains at least one lattice point of \(\Gamma\). The density of \(\Gamma\) equals 1/(2\(\Delta)\), where \(\Delta\) denotes the area of a fundamental triangle of \(\Gamma\). A holding-lattice of S of least possible density is said to be the thinnest holding-lattice of S. The problem which is answered in many cases in this paper is now the following: Find the sets whose thinnest holding-lattice is a regular triangle-lattice.

Recommendations

• Thin set versions of Hindman's theorem
• On thin, very thin, and slim dense sets
• The size of some classes of thin sets
• Publication:4955580
• scientific article; zbMATH DE number 4048795
• The lattice of embedded subsets
• Set-theoretic reducibilities with respect to a lattice of sets
• scientific article; zbMATH DE number 5837742
• Hölder coverings of sets of small dimension

This page was built for publication: The thinnest holding-lattice of a set

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