Skip to main content

Extending the PSLQ Algorithm to Algebraic Integer Relations

  • Conference paper
  • First Online:
  • 789 Accesses

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 313))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bailey, D.H., Broadhurst, D.J.: Parallel integer relation detection: techniques and applications. Math. Comput. 70(236), 1719–1736 (2001). https://doi.org/10.1090/S0025-5718-00-01278-3

  2. Bailey, D.H., Borwein, P., Plouffe, S.: On the rapid computation of various polylogarithmic constants. Math. Comput. 66(218), 903–913 (1997). https://doi.org/10.1090/S0025-5718-97-00856-9

  3. Borwein, P.: Computational Excursions in Analysis and Number Theory. CMS Books in Mathematics. Springer, New York (2002). https://doi.org/10.1007/978-0-387-21652-2

  4. Ferguson, H.R.P., Bailey, D.H.: A polynomial time, numerically stable integer relation algorithm. Technical report RNR-91-032, NAS Applied Research Branch, NASA Ames Research Center (1991)

    Google Scholar 

  5. Ferguson, H.R.P., Forcade, R.W.: Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two. Bull. Am. Math. Soc. (N.S.) 1(6), 912–914 (1979)

    Google Scholar 

  6. Ferguson, H.R.P., Bailey, D.H., Arno, S.: Analysis of PSLQ, an integer relation finding algorithm. Math. Comput. 68(225), 351–369 (1999). https://doi.org/10.1090/S0025-5718-99-00995-3

    Article  MathSciNet  MATH  Google Scholar 

  7. Heath, T.L.: The Thirteen Books of Euclid’s Elements, vol. 3. Cambridge University Press, Cambridge (1908)

    Google Scholar 

  8. Skerritt, M.P., Vrbik, P.: Algebraic-PSLQ: testing and results (Version JBCC) (2019). https://doi.org/10.5281/zenodo.3346895

  9. Stewart, I., Tall, D.: Algebraic Number Theory and Fermat’s Last Theorem. AK Peters Series, 3rd edn. Taylor & Francis, New York (2001)

    Google Scholar 

  10. Straub, A.: A gentle introduction to PSLQ (2010). http://arminstraub.com/math/pslq-intro

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthew P. Skerritt .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Skerritt, M.P., Vrbik, P. (2020). Extending the PSLQ Algorithm to Algebraic Integer Relations. In: Bailey, D., et al. From Analysis to Visualization. JBCC 2017. Springer Proceedings in Mathematics & Statistics, vol 313. Springer, Cham. https://doi.org/10.1007/978-3-030-36568-4_26

Download citation

Publish with us

Policies and ethics