This website provides scripts and log files related to the proof of the CCXC Theorem. (The paper will appear on arXiv shortly.) The table below gives a listing of the files, file types, and short descriptions.
Filename | File type | Description |
escalation_script.txt | Magma script | This script is used to do all necessary escalations of 0-3 dimensional lattices. |
prep6.txt | Magma script | This Magma script does preprocessing on all forms. It loads many other data files. |
univ3_coprime3.txt | Magma list | This is a list of the Gram matrices of the 11 ternary quadratic forms that represent all positive integers coprime to 3. (We call these relatively universal.) It is loaded by prep6.txt |
univternlist_coprime3.txt | Magma list | This is a list of which quaternaries represent which relatively universal ternaries. It is loaded by prep6.txt |
DENSITY.txt | Magma script | This Magma script was used to double-check the local densities computed by the algorithm based on Yang's paper. This file is loaded by prep6.txt. |
localdensity.txt | Magma script | This script uses Yang's formulas for local densities for primes p > 2. This file is loaded by prep6.txt |
p2\ case2.txt | Magma script | This script uses Yang's formulas for local densities for primes p = 2. This file is loaded by prep6.txt | localsplit.txt | Magma script | This script provides a function to compute the local Jordan splitting of a quadratic form. This file is loaded by prep6.txt |
beslistmake.txt | Magma script | This script pre-computes values of the |
goodlats2.out | Magma list | This list indicates which regular ternary lattice to use with which quaternary in the second method. This file is loaded by prep6.txt |
reglats.txt | Magma list | This list gives the Gram matrices of the 899 provably regular ternary quadratic forms. It is loaded by prep6.txt |
readable_quaternaries.txt | Magma list | This is a list of the 8894 regular quaternaries escalators. It is loaded by prep6.txt |
method1.out | Magma list | This list indicates which quaternaries are processed with method 1 - representing a relatively universal ternary. It is loaded by prep6.txt |
method2.out | Magma list | This list indicates which quaternaries are processed with method 2 - having a nicely embedded regular ternary. It is loaded by prep6.txt |
method3.out | Magma list | This list indicates which quaternaries are processed with method 3 - bounds on Petersson inner products. It is loaded by prep6.txt |
method4.out | Magma list | This list indicates which quaternaries are processed with method 4 - explicit newform decomposition. It is loaded by prep6.txt |
represent2_coprime3.c | C source code | This is the source code for a program that checks integers less than the F4 bound given in the output file by prep6.txt. It takes as a command line argument the output file, and writes more data to the .log file. |
primelist.gp | GP script | This is a script written in PARI/GP that computes the odd primes less than 300000000 (all 16252324 of them) and writes them to the file primelist.txt. This file is read by represent2_coprime3.c. (There are two forms that require more primes than this - a small change to this file will output the primes up to the higher bound.) |
logfiles.zip | ZIP file | This is a zipped file of the 8884 log files of the basic quaternary forms. |
newswitch.txt | Magma list | This file has a list of the gram matrices of the 727 switch case forms. With a small change, this can be read by prep6.txt |
method1s.out | Magma list | This list indicates which switch case quaternaries are processed with method 1. |
method2s.out | Magma list | This list indicates which quaternaries are processed with method 2. |
method3s.out | Magma list | This list indicates which quaternaries are processed with method 3. |
method4s.out | Magma list | This list indicates which quaternaries are processed with method 4. |
switchlogs.zip | ZIP file | This file contains the log files of the 727 switch-case quaternaries. |
looseend.txt | Magma script | This script is used to compute 5-dimensional escalations of quaternary forms with several exceptions to check which escalations fail to represent those numbers. This is how the 5-variable form that represents all positive integers coprime to 3 except 119 was found. |