Search arXivSearch

arXiv · 2507.06900

Cluster algebraic interpretation of generalized Markov numbers and their matrixizations

Abstract

Markov numbers, i.e. positive integers appearing in solutions to $x^2 + y^2 + z^2 = 3xyz$, can be viewed as specializations of cluster variables. The second author and Matsushita gave a generalization of the Markov equation, $x^2 + y^2 + z^2 + k_1yz + k_2xz + k_3xy = (3+k_1+k_2+k_3)xyz$, whose solutions can be viewed as specializations of cluster variables in generalized cluster algebras. We give two families of matrices in $SL(2,\mathbb{Z}[x_1^\pm,x_2^\pm,x_3^\pm])$ associated to these cluster structures. These matrix formulas relate to previous matrices appearing in the context of Markov numbers, including Cohn matrices and generalized Cohn matrices given by the second author, Maruyama, and Sato, as well as matrices appearing in the context of cluster algebras, including matrix formulas given by Kanatarcı Oğuz and Yıldırım. We provide a classification of the two families of matrices and exhibit an explicit family of each. The latter is done by realizing cluster variables in generalized Markov cluster algebras as weight-generating functions of order ideals in certain fence posets which are related to Christoffel words. An interesting observation is that these functions resemble Caldero-Chapoton functions for string modules, and a byproduct of our proofs is a new skein-like formula for such functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Esther Banaian, Yasuaki Gyoda. 2026-09-06. Cluster algebraic interpretation of generalized Markov numbers and their matrixizations. https://arxiv.org/abs/2507.06900

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO