The least-perimeter partition of a sphere into four equal areas (Q603841): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q125079777, #quickstatements; #temporary_batch_1711439739529 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q125079777 / rank | |||
Normal rank | |||
Revision as of 10:14, 26 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The least-perimeter partition of a sphere into four equal areas |
scientific article |
Statements
The least-perimeter partition of a sphere into four equal areas (English)
0 references
8 November 2010
0 references
The paper deals with the least-perimeter partition of the sphere into four regions of equal area. Under the assumption that each region is convex \textit{L. Fejes Tóth} solved the problem [Regular figures. International Series of Monographs on Pure and Applied Mathematics. 47. Oxford etc.: Pergamon Press. VIII, 339 p. (1964; Zbl 0134.15705)]. But in principle each region may have many components. The author proves that the least perimeter partition is the tetrahedral partition in the general case, too.
0 references
minimal partitions
0 references
isoperimetric problem
0 references
tetrahedral partition
0 references
