Abstract

Davenport and Swinnerton-Dyer found the first 19 extremal ternary cubic forms g i, 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 g 1 – g 4. 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 g 5, – g 7 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, Poincare, 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. Euler’s and Poincare’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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.