Generalised Markov numbers (Q2182151)

The authors give the following description of this research: ``In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find corresponding values in the Markov spectrum. Further we construct a counterexample to the generalised Markov uniqueness conjecture. The proposed generalisation is based on geometry of numbers. It substantively uses lattice trigonometry and geometric theory of continued numbers.'' The notions of the Markov minima and the Markov spectrum are recalled. A brief survey is devoted to these notions and certain their applications. Some attention is given to Markov numbers. One can note the following main results: an approach introduced in this paper is based on the interplay between continued fractions and convex geometry of lattice points in the cones; generalised almost Markov and Markov triples of numbers are constructed; relationships between generalised Markov triples and the elements of the Markov spectrum are established; recursive properties of generalised Markov numbers are investigated. The authors recall known definitions of continued fraction theory. Certain definitions of integer lattice geometry are introduced and its connection to continued fractions are considered. Special attention is given to the classical Perron identity. Relationships between the following objects are established: elements of the Markov spectrum, LLS sequences (lattice-length-sine sequences), reduced arrangements, and reduced forms. The Perron identity is rewritten and is studied in terms of mappings between the elements of the last-mentioned objects. Markov theory for indefinite forms with integer coefficients and a generalisation of the Markov tree are considered. For studying generalised Markov theory, a supplementary abstract structure of certain triple-graphs, is introduced, and considered triple-graphs are investigated.