On spherical tilings generated by great circles (Q1819378): Difference between revisions

The author calls the reader's attention to some unsolved problem of tiling. Conjecture 1: Let k great circles in a general position (no three having a point in common) divide a sphere into \(n=k(k-1)+2\) spherical polygons of areas \(a_ 1,...,a_ n\). Then \(\max a_ i/\min a_ i\to \infty\) as \(k\to \infty\). The following weaker statement is proved: There is a constant \(k_ 0\) such that, if \(k>k_ 0\), max \(a_ i/\min a_ i > 7.43\). The proof makes use of the isoperimetric property of the regular spherical polygons. Conjecture 2: Let us decompose a plane convex quadrangle by a finite number of straight lines into a certain number n of polygons. If the areas of these polygons are \(a_ 1,...,a_ n\) then their total perimeter is not less than the total perimeter of n squares of areas \(a_ 1,...,a_ n\). This conjecture is proved to be true under the additional assumption that the areas of the polygons are ''not too different''. Some related questions are discussed.