Abstract:
Davenport and Swinnerton-Dyer found the first 19 extremal ternary cubic forms gi, which have the same meaning as the well-known Markov forms in the binary quadratic case. Bryuno and Parusnikov recently computed the Klein polyhedra for the forms g1−g4. They also computed the “convergents” for various matrix generalizations of the continued fractions algorithm for multiple root vectors and studied their position with respect to the Klein polyhedra. In the present paper, we compute the Klein polyhedra for the forms g5−g7 and the adjoint form g∗7. Their periods and fundamental domains are found and the expansions of the multiple root vectors of these forms by means of the matrix algorithms due to Euler, Jacobi, Poincaré, Brun, Parusnikov, and Bryuno, are computed. The position of the “convergents of the continued fractions” with respect to the Klein polyhedron is used as a measure of quality of the algorithms. Eulers and Poincarés algorithms proved to be the worst ones from this point of view, and the Bryuno one is the best. However, none of the algorithms generalizes all the properties of continued fractions.
This publication is cited in the following 4 articles:
A. A. Illarionov, “Some properties of three-dimensional Klein polyhedra”, Sb. Math., 206:4 (2015), 510–539
A. D. Bryuno, “Universalnoe obobschenie algoritma tsepnoi drobi”, Chebyshevskii sb., 16:2 (2015), 35–65
A. D. Bruno, “Structure of the best diophantine approximations and multidimensional generalizations of the continued fraction”, Chebyshevskii sb., 11:1 (2010), 68–73
Alexander D. Bruno, “New generalization of continued fraction, I”, Funct. Approx. Comment. Math., 43:1 (2010)