First release – Code_OSCAR_33_and_71

This release contains the OSCAR/Julia script Code_OSCAR_33_and_71 used in the computations for the accompanying paper.

The code implements an ultra-sparse bitpacked algorithm to compute:

• a basis of admissible monomials for ((QP^5)_d) in degrees (d = 33) and (d = 71), and
• the corresponding (GL_5)-invariants.

All numerical results for (d = 33) and (d = 71) reported in the paper were obtained with this script.

Usage (OSCAR / Julia):

1. Start an OSCAR / Julia session.
2. Load the script:

   include("Code_OSCAR_33_and_71")

3. Run, for example:
   ultra_sparse_bitpacked_main(5, 33) # for d = 33
   ultra_sparse_bitpacked_main(5, 71) # for d = 71