No label defined (Q4949871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1439492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1439492 |
Statements
21 October 2001
0 references
packing similar domains in a square
0 references
0.8805724382400513
0 references
Let \(F\) denote a planar domain. A domain \(f\) is called an \(F\)-clone, if \(f\) is similar to \(F\). The paper raises the following problem: Given a domain \(F\), let \(s(F)\) be the smallest real number such that any finite set of \(F\)-clones of combined area 1 can be packed into an \(F\)-clone of area \(s\). What is \(s(F)\)? This problem has been solved with \(s=2\) for squares. The paper conjectures that \(s=2\) holds for all convex domains \(F\). It is shown that \(s\leq 3\) for all triangles. It is shown that \(s(F)\leq 2t(F)\), where \(t(F)\) is the ratio of the smallest area of an \(F\)-clone circumscribed about a unit square to the largest area of an \(F\)-clone inscribed in a unit square.
0 references