Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1808.01567

Combinatorial cluster expansion formulas from triangulated surfaces

Toshiya Yurikusa
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a cluster expansion formula for cluster algebras with principal coefficients defined from triangulated surfaces in terms of perfect matchings of angles. Our formula simplifies the cluster expansion formula given by Musiker-Schiffler-Williams in terms of perfect matchings of snake graphs. A key point of our proof is to give a bijection between perfect matchings of angles in some triangulated polygon and perfect matchings of the corresponding snake graph. Moreover, they also correspond bijectively with perfect matchings of the corresponding bipartite graph and minimal cuts of the corresponding quiver with potential.

Explore related subjects

math.COmath.ACmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Toshiya Yurikusa. 2018-11-28. Combinatorial cluster expansion formulas from triangulated surfaces. https://doi.org/10.37236/8351

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗