Is a complete, reduced set necessarily of constant width? (Q1737114)
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: Is a complete, reduced set necessarily of constant width? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is a complete, reduced set necessarily of constant width? |
scientific article |
Statements
Is a complete, reduced set necessarily of constant width? (English)
0 references
26 March 2019
0 references
A convex body \(K\) in \(\mathbb{R}^{n}\) is of constant width if the distance between any two parallel supporting hyperplanes to \(K\) is the same. A convex body is diametrically complete if any proper superset of \(K\) has a larger diameter than \(K\). In \(\mathbb{R}^{n}\) with the Euclidean norm a convex body has constant width if and only if \(K\) is diametrically complete. In \(\mathbb{R}^{n}\) with a norm different from the Euclidean norm this does not hold in general. A norm on \(\mathbb{R}^{n}\) is called perfect if this equivalence holds. This is the starting point of the paper. A convex body \(K\) is called reduced if any proper convex subset has a smaller minimal width. The authors show that a complete and reduced simplex is of constant width. This also holds for convex bodies with a smooth extreme point.
0 references
bodies of constant width
0 references
Bohnenblust's inequality
0 references
complete bodies
0 references
gauges
0 references
generalized Minkowski spaces
0 references
Leichtweiss' inequality
0 references
normed spaces
0 references
perfect norms
0 references
reduced bodies
0 references
0 references
0 references
0.7531868
0 references
0.74941224
0 references
0.74152654
0 references
0 references
0.7407764
0 references
0 references
0.73724294
0 references