To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Covering problem of Rado

From Wikipedia, the free encyclopedia

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.

YouTube Encyclopedic

  • 1/3
    Views:
    152 294
    2 177
    30 547
  • Free easy way to lower radon gas
  • Bill Tutte: A snapshot of His Life
  • Privacy, Security, Society - Computer Science for Business Leaders 2016

Transcription

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 ≈ 0.2494 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 Rd 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, Miklós (1973), "The solution of a problem of T. Radó", Bulletin de l'Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques, 21: 61–63, MR 0319053
  • Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica, 57 (3): 538–561, doi:10.1007/s00453-009-9298-z, MR 2609053; preliminary announcement in SWAT 2008, doi:10.1007/978-3-540-69903-3_27
  • Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K. (1991), Unsolved Problems in Geometry, Problem Books in Mathematics, New York: Springer-Verlag, doi:10.1007/978-1-4612-0963-8, ISBN 0-387-97506-3, MR 1107516
  • Radó, Tibor (1928), "Sur un problème relatif à un théorème de Vitali", Fundamenta Mathematicae, 11: 228–229, JFM 54.0098.02
  • Rado, Richard (1949), "Some covering theorems (I)", Proceedings of the London Mathematical Society, Second Series, 51: 232–264, doi:10.1112/plms/s2-51.3.232, MR 0030782
    —— (1951), "Some covering theorems (II)", Proceedings of the London Mathematical Society, Second Series, 53: 243–267, doi:10.1112/plms/s2-53.4.243, MR 0042149
  • Sokolin, A. (1940), "Concerning a problem of Radó", Proceedings of the USSR Academy of Sciences, 26: 871–872, Zbl 0023.11203
  • Zalgaller, V. A. (1960), "Замечания о задаче Радо", Математика, ее преподавание, приложения и история, Matematicheskoe Prosveshchenie, Ser. 2 (in Russian), vol. 5, pp. 141–148, Zbl 0145.19203
This page was last edited on 23 April 2023, at 10:52
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.