“Covering problem of Rado”的意思、由来-开放百科全书

词条

Covering problem of Rado

释义

Formulation
Upper and lower bounds
References

The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado.

Formulation

In a letter to Wacław Sierpiński, motivated by some results of Giuseppe Vitali, Tibor Radó observed that for every covering of a unit interval, one can select a subcovering consisting of pairwise disjoint intervals with total length at least 1/2 and that this number cannot be improved. He then asked for an analogous statement in the plane.

If the area of the union of a finite set of squares in the plane with parallel sides is one, what is the guaranteed maximum total area of a pairwise disjoint subset?

Radó proved that this number is at least 1/9 and conjectured that it is at least 1/4 a constant which cannot be further improved. This assertion was proved for the case of equal squares independently by A. Sokolin, R. Rado, and V. A. Zalgaller. However, in 1973, Miklós Ajtai disproved Radó's conjecture, by constructing a system of squares of two different sizes for which any subsystem consisting of disjoint squares covers the area at most 1/4 − 1/1728 of the total area covered by the system.

Upper and lower bounds

Problems analogous to Tibor Radó's conjecture but involving other shapes were considered by Richard Rado starting in late 1940s. A typical setting is a finite family of convex figures in the Euclidean space R^d that are homothetic to a given X, for example, a square as in the original question, a disk, or a d-dimensional cube. Let

where S ranges over finite families just described, and for a given family S, I ranges over all subfamilies that are independent, i.e. consist of disjoint sets, and bars denote the total volume (or area, in the plane case). Although the exact value of F(X) is not known for any two-dimensional convex X, much work was devoted to establishing upper and lower bounds in various classes of shapes. By considering only families consisting of sets that are parallel and congruent to X, one similarly defines f(X), which turned out to be much easier to study. Thus, R. Rado proved that if X is a triangle, f(X) is exactly 1/6 and if X is a centrally symmetric hexagon, f(X) is equal to 1/4.

In 2008, Sergey Bereg, Adrian Dumitrescu, and Minghui Jiang established new bounds for various F(X) and f(X) that improve upon earlier results of R. Rado and V. A. Zalgaller. In particular, they proved that

and that for any convex planar X.

References

Ajtai, M., The solution of a problem of T. Rado, Bulletin de l’Académie Polonaise des Sciences, Série des Sciences Math. Astr. et Phys. 21, 61–63 (1973)
Bereg, Sergey, Dumitrescu, Adrian, Jiang, Minghui, On covering problems of Rado, in Algorithm theory — SWAT 2008, ed by J. Gudmunsson, Lect. Notes in Comp. Sci. 5124, 294–305 (2008), Springer {{isbn|978-3-540-69900-2}}
Croft, H.T., Falconer, K.J., Guy, R.K., Unsolved Problems in Geometry, Springer, New York (1991)
Radó, T, Sur un problème relatif à un théorème de Vitali, Fundamenta Mathematicae 11: pp. 228–229 (1928)
Rado, R., Some covering theorems (I), (II), Proc. of the London Math. Soc. 51, 241–264 (1949) and 53, 243–267 (1951)
Zalgaller, V.A., [https://web.archive.org/web/20090324073835/http://ilib.mirror1.mccme.ru/djvu/mp2/mp2-5.htm Remarks on a problem of Rado] (in Russian), Matematicheskoe Prosveshchenie 5, 141–148 (1960)

3 : Covering lemmas|Discrete geometry|Unsolved problems in mathematics

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。