Alexander–Gröbner Computations 0.4.1

exact over QQFox calculusAlexander Fitting idealsreduced lex Gröbner bases

Software and frozen inputs accompanying Gröbner Bases for Alexander Fitting Ideals of Links. The package reproduces the low-crossing computations displayed in Section 3 and applies the same exact pipeline to a new oriented PD code or a finite presentation.

Windows quick start

Download the English Quickstart ZIP 64 KB Read the getting-started guide

Extract the ZIP and double-click START_HERE_WINDOWS.bat.

Inspect or reimplement

Download the Developer / Reimplementation ZIP 316 KB Download the source ZIP 98 KB Read the reimplementation guide

Package files

Download the Python wheel 31 KB Download the source distribution 65 KB Download SHA-256 checksums

What the program computes

oriented PD code / finite presentation
  -> abelianized Fox matrix A
  -> E_k = I_(n-k)(A)
  -> Laurent-to-polynomial contraction
  -> reduced lexicographic Gröbner basis AG_k

The coefficient field is QQ, and the final monomial order is t1 > ... > tell. Orientation and component order are part of the mathematical input.

Scope of reproduction

python -m alexander_grobner verify recomputes frozen inputs and compares the results with archived expected values. It does not independently certify external link-table labels, decide link equivalence, or replace the mathematical proofs in the paper.