Abstract
Letx be a point such that its expansion by Jacobi's algorithm does not possess “Störungen” (in the sense ofPerron). Let
and let ξ>1 satisfy ξn+1=ξn+1. Then at least one of 2n+1 consecutive values of g satisfiesF(x,g) > ξn+nξn−1.
Similar content being viewed by others
Literatur
Cassels, J. W. S.: An Introduction to Diophantine Approximation. Cambridge: At the University Press. 1957.
Perron, O.: Irrationalzahlen. Berlin: De Gruyter. 1960 (4. Aufl.).
Schmidt, W.: Flächenapproximation beim Jacobialgorithmus. Math. Ann.136, 365–374 (1958).
Schweiger, F.: The Metrical Theory of Jacobi-Perron Algorithm. Lecture Notes in Mathematics, Vol. 334. Berlin-Heidelberg-New York: Springer. 1973.
Schweiger, F.: Volumsapproximation beim Jacobialgorithmus. Math. Ann.203, 283–288 (1973).
Schweiger, F.: Volumsapproximation beim Jacobialgorithmus II. Acta Arithm.23, 393–400 (1973).
Author information
Authors and Affiliations
Additional information
Herrn Professor Dr. Theodor Schneider zum 65. Geburtstag
Rights and permissions
About this article
Cite this article
Schweiger, F. Der Satz von Hurwitz beim Jacobialgorithmus. Monatshefte für Mathematik 80, 215–218 (1975). https://doi.org/10.1007/BF01319917
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01319917