Certificate of order 28, child table, for "An upper bound for the connective constant of the square lattice"
Authors/Creators
Description
The file of entries (the table of children) of the certificate of order 28 for the paper An upper bound for the connective constant of the square lattice (doi:10.5281/zenodo.23551535). The paper proves that the connective constant μ of self-avoiding walks on the square lattice satisfies μ ≤ 5100683462145913/1917628724674902 = 2.659891039654… < 2.6598911. The certificate consists of three files. This record holds one of them, k28f.chosen.xz; the other two, the keys of the states and their weights, are in the record doi:10.5281/zenodo.23551536, with the two checkers, the construction program and the Lean formalization. The three compressed files take 49.7 GB, close to the size limit of a record, so they are split over two records.
Files.
k28f.chosen.xz: for each of the 5,792,114,594 states and each of the steps +x, +y and −y, the index of the child state in the sorted list of keys (counted from 0), as a 64-bit unsigned integer (little-endian), or 264 − 1 if there is no child; entry 3s + j belongs to state s and to the step +x, +y or −y for j = 0, 1, 2. Compressed with XZ Utils 5.4.1 asxz -9 -T0 -k: 18,593,405,052 bytes, SHA-256634a82630e4bfc6d82778286411b31dcebdf1a8e7a4d3548cb772413ac646ce3; after decompression withxz -dk, 139,010,750,256 bytes, SHA-25664c49e61c481539fd658b66b788052634863f3f2e15d6f5e56ee31934caeda3e.SHA256SUMS: the SHA-256 checksum of the compressed file.
The README in the zip file of the record doi:10.5281/zenodo.23551536 describes the format of the three files and how to check the certificate.
Files
Additional details
Related works
- Is required by
- Dataset: 10.5281/zenodo.23551536 (DOI)
- Is supplement to
- Preprint: 10.5281/zenodo.23551535 (DOI)