In 1956, H. Lenz introduced a problem to find members of the sequence
where the infimum is taken over all sets Φ of unit diameter. In the present paper, an upper bound for d6 is improved to 0.53432….
Similar content being viewed by others
References
K. Borsuk, “Drei Satze uber die n-dimensional euklidische Sphäre,” Fundamenta Math., 20, 177–190 (1933).
A. M. Raigorodskii, “Coloring Distance Graphs and Graphs of Diameters,” in: Thirty Essays on Geometric Graph Theory, J. Pach ed., Springer (2013), pp. 429–460.
A. M. Raigorodskii, “Cliques and cycles in distance graphs and graphs of diameters,” Contemp. Math., 625, 93–109 (2014).
A. M. Raigorodskii, “ Around Borsuk’s hypothesis,” J. Math. Sci., 154, No. 4, 604–623 (2008).
V. G. Boltyanski, H. Martini, and P. S. Soltan, Excursions into Combinatorial Geometry, Universitext, Springer, Berlin (1997).
P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry, Springer (2005).
H. Lenz, “Zerlegung ebener Bereiche in konvexe Zellen von möglichst kleinem Durchmesser,” Jber. Deutch. Math. Verein., 58, 87–97 (1956).
H. Lenz, “Uber die Bedeckung ebenem Punktmengen durch solche kleineren Durchmessers,” Arch. Math. (Basel), 7, No. 1, 34–40 (1956).
V. P. Filimonov, “Covering planar sets,” Sb. Math., 201, No. 8, 1217–1248 (2010).
D. A. Belov and N. A. Alexandrov, “On partition of plane sets into six parts of small diameter,” Trudy MFTI, 4, No. 1, 77–80 (2012).
Calculations check, https://github.com/VadymKoval/calculations-check.git
V. P. Filimonov, “Covering sets in ℝm,” Sb. Math., 205, No. 8, 1160–1200 (2014).
R. I. Prosanov, “Counterexamples to Borsuk’s conjecture that have large girth,” Math. Notes, 105, No. 5–6, 874–880 (2019).
A. Kupavskii and A. Polyanskii, “Proof of Schur’s conjecture in ℝd,” Combinatorica, 37, No. 6, 1181–1205 (2017).
A. Kupavskii and A. Polyanskii, “On simplices in diameter graphs in ℝ4,” Math. Notes, 101, No. 2, 232–246 (2017).
A. M. Raigorodskii and L. I. Bogolubsky, “On bounds in Borsuk’s problem,” Trudy MFTI, 11, No. 3, 20–49 (2019).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 497, 2020, pp. 100–123.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Koval, V.O. On the Partition of Plane Sets Into 6 Subsets of Small Diameter. J Math Sci 275, 177–194 (2023). https://doi.org/10.1007/s10958-023-06670-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-023-06670-0