Hadwiger conjecture (combinatorial geometry): Difference between revisions

Revision as of 14:57, 2 July 2016

Revision as of 21:02, 20 March 2018

Line 1:

{{see also|Hadwiger conjecture (graph theory)}}

[[File:Hadwiger covering.svg|thumb|300px|A triangle can be covered by three smaller copies of itself; a square requires four smaller copies]]

{{unsolved|mathematics|Can every ''<math>n''</math>-dimensional convex body be covered by 2<supmath>''2^n''</supmath> smaller copies of itself?}}

In [[combinatorial geometry]], the '''Hadwiger conjecture''' states that any [[convex body]] in ''n''-dimensional [[Euclidean space]] can be covered by 2^''n'' or fewer smaller bodies [[Homothetic transformation|homothetic]] with the original body, and that furthermore, the upper bound of 2^''n'' is necessary [[if and only if|iff]] the body is a [[parallelepiped]]. There also exists an equivalent formulation in terms of the number of floodlights needed to illuminate the body.