On a conjecture of Grünbaum concerning partitions of convex sets (Q532112): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Let \(K\) be a convex body in the plane. Then there exists a pair of orthogonal lines that partition \(K\) into four pieces of equal area. A conjecture of B. Grünbaum generalizes this results. Let \(K\) be a convex body in the plane with area 1. Then, for each \(t\in [0,1/4]\), there exists a pair of orthogonal lines that partition \(K\) into four pieces of area \(t\), \(t\), \(1/2-t\), \(1/2-t\) in clockwise order. The authors prove the conjecture if diam\((K)\geq \sqrt{37}w\), where \(w\) is the minimum width of \(K\). If \(K\) is centrally symmetric, then the factor \(\sqrt{37}\) can be replaced by 3. | |||
Property / review text: Let \(K\) be a convex body in the plane. Then there exists a pair of orthogonal lines that partition \(K\) into four pieces of equal area. A conjecture of B. Grünbaum generalizes this results. Let \(K\) be a convex body in the plane with area 1. Then, for each \(t\in [0,1/4]\), there exists a pair of orthogonal lines that partition \(K\) into four pieces of area \(t\), \(t\), \(1/2-t\), \(1/2-t\) in clockwise order. The authors prove the conjecture if diam\((K)\geq \sqrt{37}w\), where \(w\) is the minimum width of \(K\). If \(K\) is centrally symmetric, then the factor \(\sqrt{37}\) can be replaced by 3. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Agota H. Temesvári / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52A10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52A38 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5881208 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Grünbaum conjecture | |||
Property / zbMATH Keywords: Grünbaum conjecture / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bisector line | |||
Property / zbMATH Keywords: bisector line / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
reflections | |||
Property / zbMATH Keywords: reflections / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quadrupartitions of convex sets | |||
Property / zbMATH Keywords: quadrupartitions of convex sets / rank | |||
Normal rank |
Revision as of 08:06, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a conjecture of Grünbaum concerning partitions of convex sets |
scientific article |
Statements
On a conjecture of Grünbaum concerning partitions of convex sets (English)
0 references
26 April 2011
0 references
Let \(K\) be a convex body in the plane. Then there exists a pair of orthogonal lines that partition \(K\) into four pieces of equal area. A conjecture of B. Grünbaum generalizes this results. Let \(K\) be a convex body in the plane with area 1. Then, for each \(t\in [0,1/4]\), there exists a pair of orthogonal lines that partition \(K\) into four pieces of area \(t\), \(t\), \(1/2-t\), \(1/2-t\) in clockwise order. The authors prove the conjecture if diam\((K)\geq \sqrt{37}w\), where \(w\) is the minimum width of \(K\). If \(K\) is centrally symmetric, then the factor \(\sqrt{37}\) can be replaced by 3.
0 references
Grünbaum conjecture
0 references
bisector line
0 references
reflections
0 references
quadrupartitions of convex sets
0 references