Search arXivSearch

arXiv · 1205.0034

C-sortable words as green mutation sequences

Abstract

Let $Q$ be an acyclic quiver and $\mathbf{s}$ be a sequence with elements in the vertex set $Q_0$. We describe an induced sequence of simple (backward) tilting in the bounded derived category $\mathcal{D}(Q)$, starting from the standard heart $\mathcal{H}_Q=\operatorname{mod}\mathbf{k}Q$ and ending at another heart $\mathcal{H}_\mathbf{s}$ in $\mathcal{D}(Q)$. Then we show that $\mathbf{s}$ is a green mutation sequence if and only if every heart in this simple tilting sequence is greater than or equal to $\mathcal{H}_Q[-1]$; it is maximal if and only if $\mathcal{H}_\mathbf{s}=\mathcal{H}_Q[-1]$. This provides a categorical way to understand green mutations. Further, fix a Coxeter element $c$ in the Coxeter group $W_Q$ of $Q$, which is admissible with respect to the orientation of $Q$. We prove that the sequence $\widetilde{\mathbf{w}}$ induced by a $c$-sortable word $\mathbf{w}$ is a green mutation sequence. As a consequence, we obtain a bijection between $c$-sortable words and finite torsion classes in $\mathcal{H}_Q$. As byproducts, the interpretations of inversions, descents and cover reflections of a $c$-sortable word $\mathbf{w}$ are given in terms of the combinatorics of green mutations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu Qiu. 2015-05-26. C-sortable words as green mutation sequences. https://doi.org/10.1112/plms%2Fpdv046

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