Related papers: Markoff Equation and Nilpotent Matrices

A triple (a, b, c) of positive integers is called a Markoff triple iff it satisfies the Diophantine equation a2+b2+c2=abc . Recasting the Markoff tree, whose vertices are Markoff triples, in the framework of integral upper triangular 3x3…

The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and…

For a positive integer $m>1$, if the generalized Markoff equation $a^2+b^2+c^2=3abc+m$ has a solution triple, then it has infinitely many solutions. We show that all positive solution triples are generated by a finite set of triples that we…

We classify all solution triples with $k$-Fibonacci components to the equation $x^2+y^2+z^2=3xyz+m,$ where $m$ is a positive integer and $k\geq 2$. As a result, for $m=8$, we have the Markoff triples with Pell components $(F_2(2), F_2(2n),…

We propose an equivalent condition for the Markov triples, which was mentioned by H. Rademacher essentially. As an application, we study the solvability of the Diophantine equation $a^2+b^2+c^2=abcf(a,b,c)$.

An analysis of the Markov tree is presented. Markov triplets, {x,R,z}, are the positive integer solutions to the Diophantine equation x2 + R2 + z2 = 3xRz. Inspired by patterns of the Fibonacci and Pell triplets in Region 1 and Region 2 of…

We classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…

We give a simple and independent proof of the result of Jack Button and Paul Schmutz that the Markoff conjecture on the uniqueness of the Markoff triples (a,b,c), where a, b, and c are in increasing order, holds whenever $c$ is a prime…

Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…

The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…

Markov numbers are integers that appear in triples which are solutions of a Diophantine equation, the so-called Markov cubic $$x^2 + y^2 + z^2 - 3x y z = 0.$$ A classical topic in number theory, these numbers are related to many areas of…

We give conditions on the rational numbers a,b,c which imply that there are infinitely many triples (x,y,z) of rational numbers such that x+y+z=a+b+c and xyz=abc. We do the same for the equations x+y+z=a+b+c and x^3+y^3+z^3=a^3+b^3+c^3.…

We study an extension to the uniqueness conjecture for Markov numbers. For any three positive integers $m\geq a$ and $m\geq b$ satisfying $a^2+b^2+m^2=3abm$, this conjecture states that the triple $(a,m,b)$ is uniquely determined by the…

The Markov numbers are the positive integers that appear in the solutions of the equation $x^2+y^2+z^2=3xyz$. These numbers are a classical subject in number theory and have important ramifications in hyperbolic geometry, algebraic geometry…

We discuss properties of diophantine solutions of the Pythagoras equation, $a^2+b^2=c^2$, where the three numbers have no common factor. Some of the highlights are: (1) All triplets for which $c$ (called the `peak') is non-prime can be…

By making use of only simple facts about congruence, we first show that every even Markoff number is congruent to 2 modulo 32, and then, generalizing an earlier result of Baragar, establish the uniqueness for those Markoff numbers c where…

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

In this paper, we deal with two classes of Diophantine equations, $x^2+y^2+z^2+k_1yz+k_2zx+k_3xy=(3+k_1+k_2+k_3)xyz$ and $x^2+y^4+z^4+ky^2z^2+2xz^2+2xy^2=(7+k)xy^2z^2$, where $k_1,k_2,k_3,k$ are nonnegative integers. The former is known as…

We introduce a family of modules, called Markoff modules, generated by a cluster-mutation-like iterative process. We show that these modules are combinatorially similar to Christoffel words. Furthermore, we construct a bijective map between…

We study infinite paths of Markoff $m$-triples, that is, solutions to the generalised Markoff equation \[ x^2+y^2+z^2=3xyz+m, \] with $m>0$, with at least two $k$-Fibonacci components. First, we obtain a complete classification of Markoff…