English

Partial Resolutions and Noncrossing Combinatorics

Representation Theory 2026-01-27 v1 Combinatorics Quantum Algebra

Abstract

For any finite reductive group, we compute the central elements in its Hecke algebra that arise from partial Springer resolutions via the Harish-Chandra transform. Of the two kinds of partial resolution, the larger is the more interesting case. We deduce formulas for associated Hecke traces, generalizing work of Wan-Wang beyond type AA, and Deodhar-like decompositions of braid varieties that map to partial Springer resolutions. From the latter, we construct noncrossing sets that interpolate between rational Catalan and parking objects, generalizing our work with Galashin-Lam. In parallel, we establish new formulas for arbitrary aa-degrees of the HOMFLYPT invariants of positive braid closures, from which we construct noncrossing sets for rational Kirkman numbers.

Keywords

Cite

@article{arxiv.2601.17293,
  title  = {Partial Resolutions and Noncrossing Combinatorics},
  author = {Minh-Tâm Quang Trinh and Nathan Williams},
  journal= {arXiv preprint arXiv:2601.17293},
  year   = {2026}
}

Comments

39 pages, 1 figure

R2 v1 2026-07-01T09:18:15.665Z