Skip to main content

The arithmetic functions of the Jacobi-Perron Algorithm

  • 1097 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 251)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bernstein, The modified algorithm of Jacobi-Perron, Mem. Amer. Math. Soc. 67 (1966), 1–44.

    MathSciNet  MATH  Google Scholar 

  2. L. Bernstein, Periodical continued fractions of degree n by Jacobi's algorithm, J. Reine. Angew. Math. 213 (1964), 31–38.

    MathSciNet  Google Scholar 

  3. L. Bernstein, New infinite classes of periodic Jacobi-Perron algorithms, Pacific J. Math. 16 (1965), 1–31.

    MathSciNet  Google Scholar 

  4. L. Bernstein, Einheitenberechnung in kubischen Koerpern mittels des Jacobi-Perronschen Algorithmus aus der Rechenanlage, J. Reine Angew. Math. 244 (1970), 201–220.

    MathSciNet  MATH  Google Scholar 

  5. L. Bernstein, An explicit summation formula and its application, Proc. Amer. Math. Soc. 25, (1970), 323–334.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. L. Bernstein, Units and fundamental units, (to appear)

    Google Scholar 

  7. L. Bernstein, The generalized Pellian equation, Trans. Amer. Math. Soc. 127 (1967), 76–89.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. L. Bernstein and H. Hasse, Einheitenberechnung mittels des Jacobi-Perronschen Algorithmus, J. Reine Angew. Math. 218 (1965), 51–69.

    MathSciNet  MATH  Google Scholar 

  9. L. Bernstein and H. Hasse, An explicit formula for the units of an algebraic number field of degree n ≥ 2, Pacific J. Math. 30 (1969), 293–365.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. L. Bernstein and H. Hasse, Explicit determination of the matrices in periodic algorithms of the Jacobi-Perron type with application to generalized Fibonacci numbers with time impulses, Fibonacci Quart. 7 (1969), 394–436.

    MathSciNet  MATH  Google Scholar 

  11. M. Davis, An explicit Diophantine definition of the exponential function, (to appear).

    Google Scholar 

  12. C. G. J. Jacobi, Allgemeine Theory der kettenbruchaehnlichen Algorithmen, in welchen jede Zahl aus drei vorhergehenden gebildet wird, J. Reine Angew. Math. 69 (1869), 29–64.

    MathSciNet  Google Scholar 

  13. Ju. V. Matijasevič, Enumerable sets are Diophantine (Russian), Soviet Math. Dokl. 11 (1970), 4–8.

    Google Scholar 

  14. O. Perron, Grundlagen fuer eine Theorie der Jacobischen Kettenbruchalgorithmus, Math. Ann. 64 (1907), 1–76.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. J. Stender, Ueber die Grundeinheit fuer spezielle unendliche Klassen reiner kubischer Zahlkoerper, Abh. Math. Sem. Univ. Hamburg, 33 (1969), 203–215.

    CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1972 Springer-Verlag

About this paper

Cite this paper

Bernstein, L. (1972). The arithmetic functions of the Jacobi-Perron Algorithm. In: Gioia, A.A., Goldsmith, D.L. (eds) The Theory of Arithmetic Functions. Lecture Notes in Mathematics, vol 251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058784

Download citation

  • DOI: https://doi.org/10.1007/BFb0058784

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05723-9

  • Online ISBN: 978-3-540-37098-7

  • eBook Packages: Springer Book Archive