Certificate of order 30, part 4 of 5, for "An upper bound for the connective constant of the square lattice"
Authors/Creators
Description
Part 4 of 5 of the certificate of order 30 for the paper An upper bound for the connective constant of the square lattice (doi:10.5281/zenodo.23574053). The paper proves that the connective constant μ of self-avoiding walks on the square lattice satisfies μ ≤ 105432502045487/39656386815908 = 2.658651241600… < 2.6586513. The certificate consists of three files, 995.5 GB in all: the keys of its 24,887,440,008 states, the entries (the table of children) and the weights. They were compressed with xz: the file of keys as a whole, the file of entries in four pieces and the file of weights in five. The ten compressed files, which take 210.4 GB, are spread over five records: doi:10.5281/zenodo.23574056, doi:10.5281/zenodo.23574058, doi:10.5281/zenodo.23574060, doi:10.5281/zenodo.23574062 and doi:10.5281/zenodo.23574064. The programs, the README and the Lean formalization are in the record doi:10.5281/zenodo.23574054; the README in its zip file describes the format of the files, how to join the pieces and how to check the certificate.
Files.
k30e.v.part2.xz: piece 2 of 5 of the file of weightsk30e.v, compressed (bytes 39,819,935,744 to 79,639,871,487 of the uncompressed file); 27,398,464,332 bytes, SHA-256b8fc195c1ea81d42af13323aaf2dee7c4f5b7b235da02633fecf688fcc8aec3a.k30e.v.part5.xz: piece 5 of 5 of the file of weightsk30e.v, compressed (bytes 159,279,742,976 to 199,099,520,063 of the uncompressed file); 14,481,453,436 bytes, SHA-2561a6416e72bb6ea21d31957a66adc74d1ecd0b447da15e157663f465036caebc3.SHA256SUMS: the SHA-256 checksums of the files of this record.
Files
Additional details
Related works
- Is required by
- Dataset: 10.5281/zenodo.23574054 (DOI)
- Is supplement to
- Preprint: 10.5281/zenodo.23574053 (DOI)