Conway's fried potato problem revisited

DOI10.1007/BF01268872MaRDI QIDQ1924940zbMATH OpenOpenAlexFDO

Authors Károly Bezdek, A. Bezdek

Publication date 27 October 1996

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01268872

zbMATH Keywords

convex bodyminimum width

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Review text

Assume we have two convex bodies \(K\) and \(B\) in the \(d\)-dimensional Euclidean space \(E^d\), and one of them, say \(K\), is sliced into \(n \geq 1\) pieces by \(n - 1\) successive hyperplane cuts (just one piece being divided by each cut). We determine a sharp lower bound for the size of the largest homothetic copy of the other convex body \(B\) (in terms of some parameters of \(K\) and \(B)\), which has a translate contained in one of the pieces of \(K\).

Recommendations

• A Solution of Conway's Fried Potato Problem
• Slicing convex sets and measures by a hyperplane
• Slicing convex sets and measures by a hyperplane
• scientific article; zbMATH DE number 421698

Cites work

• A Problem About Lines and Ovals
• A Solution of Conway's Fried Potato Problem
• A Solution of the "Plank Problem"
• Decomposition of a convex region by lines
• Unsolved problems in geometry

Cited in

(7)

• A multi-plank generalization of the Bang and Kadets inequalities
• A Solution of Conway's Fried Potato Problem
• A generalization of Bang’s lemma
• Optimal divisions of a convex body
• Plank theorems and their applications: a survey
• Kadets-type theorems for partitions of a convex body
• Minimum partition of polygons under width and cut constraints

This page was built for publication: Conway's fried potato problem revisited

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