Search arXivSearch

arXiv · 2606.06352

Equivariant Quantum Cohomology of Grassmannians via the Clifford algebra

Abstract

We construct an explicit equivariant quantum Satake map for Grassmannians, which enables us to express their torus-equivariant quantum cohomology in terms of that of projective space. We then consider the exterior algebra of the latter, which admits a canonical identification with a Clifford algebra. We describe the resulting action in several complementary ways: first, from a geometric perspective via push-pull maps, and second, in terms of the shuffle product, which also arises in the simplest cohomological Hall algebra associated with the $A_1$-quiver. Exploiting the Clifford algebra structure, we derive new recurrence relations among equivariant Gromov-Witten invariants, yielding a new method for their computation in terms of Wick's Theorem. As an application, we provide combinatorial proofs of Graham positivity for both equivariant quantum Pieri rules, and in one case extend these results to quantum triple Schubert calculus.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Korff, Mikhail Vasilev. 2026-06-04. Equivariant Quantum Cohomology of Grassmannians via the Clifford algebra. https://arxiv.org/abs/2606.06352

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