Search arXivSearch

arXiv · 2207.11861

Zonotopal algebras, orbit harmonics, and Donaldson-Thomas invariants of symmetric quivers

Abstract

We apply the method of orbit harmonics to the set of break divisors and orientable divisors on graphs to obtain the central and external zonotopal algebras respectively. We then relate a construction of Efimov in the context of cohomological Hall algebras to the central zonotopal algebra of a graph $G_{Q,γ}$ constructed from a symmetric quiver $Q$ with enough loops and a dimension vector $γ$. This provides a concrete combinatorial perspective on the former work, allowing us to identify the quantum Donaldson-Thomas invariants as the Hilbert series of the space of $S_γ$-invariants of the Postnikov-Shapiro slim subgraph space attached to $G_{Q,γ}$. The connection with orbit harmonics in turn allows us to give a manifestly nonnegative combinatorial interpretation to numerical Donaldson-Thomas invariants as the number of $S_γ$-orbits under the permutation action on the set of break divisors on $G_{Q,γ}$. We conclude with several representation-theoretic consequences, whose combinatorial ramifications may be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Markus Reineke, Brendon Rhoades, Vasu Tewari. 2022-08-17. Zonotopal algebras, orbit harmonics, and Donaldson-Thomas invariants of symmetric quivers. https://arxiv.org/abs/2207.11861

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