Papers › Extending the PSLQ Algorithm to Algebraic Integer Relations
Extending the PSLQ Algorithm to Algebraic Integer Relations
Matthew P. Skerritt, Paul Vrbik
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The PSLQ algorithm computes integer relations for real numbers and Gaussian integer relations for complex numbers. We endeavour to extend PSLQ to find integer relations consisting of algebraic integers from some quadratic extension fields (in both the real and complex cases). We outline the algorithm, discuss the required modifications for handling algebraic integers, problems that have arisen, experimental results, and challenges to further work.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections