Loading...
Loading...
Contributors:
Dataset URI:
10.5281/zenodo.23509974Certificates, checkers and programs for the paper A lower bound of 0.836 for Lebesgue's universal covering problem (doi:10.5281/zenodo.23509971). The paper proves that every convex set in the plane that contains a congruent copy of every set of diameter 1 has area at least 0.836. Let D be the disk of diameter 1, let Bn be the regular Reuleaux n-gon of width 1, and let M(T1, …, Tm) be the least area of the convex hull of congruent copies of T1, …, Tm. The paper proves M(D, B3, B5, B7) ≥ 0.836 and M(D, B3, B5) ≥ 0.8347. Files.cert8d_0836.tar.xz: the certificate of M(D, B3, B5, B7) ≥ 0.836 (24 parts).cert5d_08347.tar.xz: the certificate of M(D, B3, B5) ≥ 0.8347 (16 parts).SHA256SUMS: the checksums of the two archives.lebesgue-cover-bound-f82dcc62ed92.zip: the certificates, the checker, the tree decoder, the independent verifiers and negative tests, and the search programs, identical to the GitHub repository github.com/tejasvi/lebesgue-cover-bound at commit f82dcc62ed921ba75d5c97e722dca41844a621cd. Sizes and checksums. Each .tar.xz file decompresses to the .tar file of the same name, which holds one directory with the parts of the certificate and a SHA256SUMS file for them.cert8d_0836.tar.xz: 487,316 bytes, SHA-256 d8a7f09dc236a7c647147bacc3e903f3c9e2bd2cadb601d000d1a67a2a237681cert8d_0836.tar: 1,617,920 bytes, SHA-256 12432e0a1e3b8b56a47454eed3cc4d6dac376f0e3525e486492eac6ec31afb03cert5d_08347.tar.xz: 17,308 bytes, SHA-256 2026ebe7e5339b89542e0429e5ad704b1a956278e3ae455b6d667b4c11892846cert5d_08347.tar: 92,160 bytes, SHA-256 cb14e4ac6569d4709a83114facb4fc77b731dfd964a483e8238b52147a3c249e Checking. The checker needs Python 3, NumPy and python-flint. In the unpacked zip, after extracting the two archives in certificates/, the command python3 -I ../checker/lbcheck.py cert8d_0836 $(seq 0 23) checks all parts of the main certificate, which takes about 119 core-minutes in total. The parts are independent and can run in parallel. The command python3 -I ../checker/treecheck.py cert8d_0836 checks that the leaves tile the root box. The README lists all commands, the rule for accepting a certificate, and the independent programs.
Keyword(s):
branch and bound; computer-assisted proof; convex hull; interval arithmetic; Lebesgue's universal covering problem.
Grants and Funding:
No Grants or Funding Data Available
Associated Publication(s):
Supplementary Data:
No Supplementary Data Available
Related Dataset(s):
No Related Dataset Data Available
The National Library of Medicine (NLM) provides information about biomedical datasets. Inclusion on an NLM Web page does not imply endorsement of, or agreement with, the contents by NLM or the National Institutes of Health. Learn more: NLM Web Policies (nih.gov)