Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1606.03799

Maximal green sequences for quivers of finite mutation type

Matthew R. Mills
View original source ↗Read source document ↗Export metadata ↓

Abstract

In general, the existence of a maximal green sequence is not mutation invariant. In this paper we show that it is in fact mutation invariant for cluster quivers of finite mutation type. In particular, we show that a mutation finite cluster quiver has a maximal green sequence unless it arises from a once-punctured closed marked surface, or one of the two quivers in the mutation class of X7. We develop a procedure to explicitly find maximal green sequences for cluster quivers associated to arbitrary triangulations of closed marked surfaces with at least two punctures. As a corollary, it follows that any triangulation of a marked surface with boundary has a maximal green sequence. We also compute explicit maximal green sequences for exceptional quivers of finite mutation type.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew R. Mills. 2016-06-13. Maximal green sequences for quivers of finite mutation type. https://arxiv.org/abs/1606.03799

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↗