Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1403.6149

On Maximal Green Sequences For Type A Quivers

Alexander Garver·Gregg Musiker
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a framed quiver, i.e. one with a frozen vertex associated to each mutable vertex, there is a concept of green mutation, as introduced by Keller. Maximal sequences of such mutations, known as maximal green sequences, are important in representation theory and physics as they have numerous applications, including the computations of spectrums of BPS states, Donaldson-Thomas invariants, tilting of hearts in the derived category, and quantum dilogarithm identities. In this paper, we study such sequences and construct a maximal green sequence for every quiver mutation-equivalent to an orientation of a type A Dynkin diagram.

Explore related subjects

math.COmath.ACmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Garver, Gregg Musiker. 2016-05-18. On Maximal Green Sequences For Type A Quivers. https://doi.org/10.1007/s10801-016-0716-4

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↗