惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
腾讯CDC
M
MIT News - Artificial intelligence
Y
Y Combinator Blog
L
LangChain Blog
Vercel News
Vercel News
云风的 BLOG
云风的 BLOG
GbyAI
GbyAI
Stack Overflow Blog
Stack Overflow Blog
Microsoft Azure Blog
Microsoft Azure Blog
B
Blog RSS Feed
The GitHub Blog
The GitHub Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
B
Blog
P
Proofpoint News Feed
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园_首页
Google DeepMind News
Google DeepMind News
WordPress大学
WordPress大学
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
IT之家
IT之家
A
About on SuperTechFans
H
Help Net Security

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Broken lines and compatible pairs for rank 2 quantum clus...
Amanda Burcroff, Kyungyong Lee · 2024-04-23 · via math.CO updates on arXiv.org

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.