Hostname: page-component-848d4c4894-x5gtn Total loading time: 0 Render date: 2024-06-07T10:30:51.952Z Has data issue: false hasContentIssue false
  • English
  • Français

Periodic Algorithms and their Application

Published online by Cambridge University Press:  20 November 2018

Leon Bernstein
Leon Bernstein*
Affiliation:
Illinois Institute of Technology, Chicago, Illinois
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In two previous papers [1, 2] we investigated the zeros of certain arithmetic functions. Using units of cubic fields, we also succeeded to construct, almost by accident, and as a by-product so to speak, entirely new and comparatively complicated combinatorial identities. In an interesting paper combinatorialist L. Carlitz [10] proved those identities in an elementary way. In a/m, we had to prove that the units used were fundamental ones.

Encouraged by these results, we took a closer look at this method that had led to the construction of combinatorial identities. Since the latter are such an important tool in mathematics, we thought it would be “einer Messe wert“ to generalize these results and lay the theoretical foundations of a new method for the construction of highly sophisticated combinatorial identities.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 31 , Issue 3 , 01 June 1979 , pp. 565 - 595
Copyright
Copyright © Canadian Mathematical Society 1979

References

1. Bernstein, L., Zeros of the function , Jr. Number Theory, Vol. 6, No. 4 (1974), 264–270.Google Scholar
2. Bernstein, L., Zeros of combinatorial functions and combinatorial identities, Houston J. of Math., Vol. 2, No. 1 (1976), 9–16.Google Scholar
3. Bernstein, L., Combinatorial identities—a new approach, submitted.Google Scholar
4. Bernstein, L., The Jacobi-Perron algorithm, its theory and application, Lecture Notes in Math., 207, Springer-Verlag, I-IV + 160 (1971).Google Scholar
5. Bernstein, L., The modified algorithm of Jacobi-Perron, Memoirs Amer. Math. Soc. 67 (1966), 1–44.Google Scholar
6. Bernstein, L., Truncated units, Annal. Math.. 213 (1975), 275–279.Google Scholar
7. Bernstein, L., Fermâtes last theorem—A new approach, submitted.Google Scholar
8. Bernstein, L. and Hasse, H., Einheitenberechuung mittels des Jacobi-P erronschen algorithmus, J. f. d. reine ange w. Math.. 218 (1965), 51–69.Google Scholar
9. Bernstein, L. and Hasse, H., An explicit formula for the units of an algebraic number field of degree n > 2, Pacific J. Math., 30 (no. 2), (1969), 293–365.+2,+Pacific+J.+Math.,+30+(no.+2),+(1969),+293–365.>Google Scholar
10. Carlitz, L., On a paper of Bernstein, to appear.Google Scholar
11. Halter-Koch, F., Unabhàngige einheitensysteme fur eine allgemeine klasse algebraischer zahlkorper, Abh. Math. Sem. Hamburg. 43 (1975), 85–91.Google Scholar
12. Halter-Koch, F., and Stender, H. J., Unabhàngige einheiten fur die kôrper , Abh. Math. Sem. Hamburg.Google Scholar
13. Stender, H. J., Eine formel fur grundeinheiten in reinen algebraischen zahlkôrpern dritten, vierten und sechsten grades, J. Number Theory I (1975), 235–250.Google Scholar