Search arXivSearch

arXiv · 2602.14802

A mirror deformation of Markov numbers

Abstract

We introduce a deformed squared Markov equation given by $X^2 + Y^2 + Z^2 + (q+q^{-1})(XY+YZ+XZ) = 3(1 + q + q^{-1})XYZ$. Symmetric solutions of this new equation present a remarkable factorization property which allows us to talk about their square roots. These square roots give a natural $q$-deformation of the Markov numbers that has not previously occurred in the literature. We call them mirror Markov numbers. We prove a characterization of mirror Markov numbers and discover a mutation rule, mirror mutation, to generate them all. We also prove a geometric realization of the corresponding mirror mutation on a once-punctured sphere with three orbifold points. Our mirror deformation leads to deformations of Fibonacci and Pell branches for which we give precise formulas. Furthermore, the deformed squared Markov equation specializes to many other very well known generalized Markov equations. We also obtain the super Markov numbers from a specialization of the deformed squared Markov numbers, which we use to prove a conjecture of Musiker.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Léa Bittmann, Perrine Jouteur, Ezgi Kantarcı Oğuz, Melody Molander, Emine Yıldırım. 2026-02-16. A mirror deformation of Markov numbers. https://arxiv.org/abs/2602.14802

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO