Abstract:
Diophantine approximations of linear combinations with real algebraic numbers of arbitrary degree are considered. Using the recurrence relation it is possible to generate an infinite sequence of integer approximations of the linear forms. We prove that the resulting Diophantine approximations are the best relative to some polyhedral norms that are ray functions or the Minkowski functionals.
Key words and phrases:best Diophantine approximations of linear forms, inverse simplex-modular algorithm.