What is the minimum length of a non-extendable lace? (Q1591729)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: What is the minimum length of a non-extendable lace? |
scientific article; zbMATH DE number 1549699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What is the minimum length of a non-extendable lace? |
scientific article; zbMATH DE number 1549699 |
Statements
What is the minimum length of a non-extendable lace? (English)
0 references
9 January 2001
0 references
A finite sequence of distinct non-overlapping congruent circles in the plane is called a lace if any two consecutive circles touch; a lace is called a loop if the first and last circle in the sequence also touch. The authors discuss various problems, conjectures, and results on the minimum length (number of circles) of non-extendable laces or loops; that is laces or loops, respectively, which are not properly contained in another lace or loop. For example, the authors conjecture that the minimum length of a non-extendable lace or loop is at least 21, and prove that it is at least 15 for non-extendable loops or ``weakly non-extendable'' laces.
0 references
finite packing
0 references
circles
0 references
plane
0 references
0.7010105848312378
0 references
0.6876397728919983
0 references
0.6753392815589905
0 references
0.6750118136405945
0 references