REVIEW 1 cited by
Broken lines and compatible pairs for rank 2 quantum cluster algebras
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
There have been several combinatorial constructions of universally positive bases in cluster algebras, and these same combinatorial objects play a crucial role in the known proofs of the famous positivity conjecture for cluster algebras. The greedy basis was constructed in rank $2$ by Lee-Li-Zelevinsky using compatible pairs on Dyck paths. The theta basis, introduced by Gross-Hacking-Keel-Kontsevich, has elements expressed as a sum over broken lines on scattering diagrams. It was shown by Cheung-Gross-Muller-Musiker-Rupel-Stella-Williams that these bases coincide in rank $2$ via algebraic methods, and they posed the open problem of giving a combinatorial proof by constructing a (weighted) bijection between compatible pairs and broken lines. We construct a quantum-weighted bijection between compatible pairs and broken lines for the quantum type $A_2$ and the quantum Kronecker cluster algebras. By specializing the quantum parameter, this handles the problem of Cheung et al. for skew-symmetric cluster algebras of finite and affine type. For cluster monomials in skew-symmetric rank-$2$ cluster algebras, we construct a quantum-weighted bijection between positive compatible pairs (which comprise almost all compatible pairs) and broken lines of negative angular momentum.
Forward citations
Cited by 1 Pith paper
-
Wild wall-crossing and symmetric quivers in 4d and 3d $\mathcal{N}=2$ field theories
The paper derives a tree-of-unlinkings formula for wild Donaldson-Thomas invariants of m-Kronecker quivers from wall-crossing identities rewritten through symmetric quivers and diagonalization.
Discussion (0). Sign in to comment.