Searcharxiv⌕ Search

arXiv subjects

Luis Ángel Calvo

Publications and source records attributed to Luis Ángel Calvo.

2 recordsLinked to original sources

Branches of Markoff $m$-triples with two $k$-Fibonacci components

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 $m$-triples whose last two entries are $k$-Fibonacci numbers and that are not roots of any Markoff trees. We then prove that every such infinite path is contained in a branch, starting at a triple of the form \[ \left(\frac{F_k(4r)}{3F_k(2r)},\,F_k(\ell+2r),\,F_k(\ell+4r)\right), \] where $r$ is an odd integer, $\ell\in\{1,2,\ldots, 2r\}$ and $3\nmid k$. These branches are distributed among exactly $2r$ distinct trees.

math.NT↗

On Intensity of Preference Rank Reversal in the AHP

The analytic hierarchy process (AHP) is one of the most widely used multicriteria decision-making methods, with applications from agriculture to space engineering. Despite its popularity, AHP has been repeatedly criticised for rank reversal, a phenomenon in which the ranking of alternatives changes after the addition or removal of an irrelevant or duplicate alternative. This paper introduces a new type of rank reversal in AHP, arising when the intensity of preferences is uniformly increased. We show that even when all pairwise preferences preserve their direction and are intensified identically, the eigenvector method may produce a different ordering of alternatives. In contrast, the geometric mean (GM) method is robust to this intensity-of-preference (IOP) rank reversal. The applicability of this result is shown through a real decision-making problem taken from a NASA manual concerning capability prioritisation for the planned lunar Gateway orbital station.

math.OC↗