Partial Resolutions and Noncrossing Combinatorics

TL;DR

This paper explores the interplay between partial Springer resolutions, Hecke algebra elements, and noncrossing combinatorics, providing new formulas and constructions that connect algebraic, geometric, and combinatorial structures.

Contribution

It introduces new formulas for Hecke traces, generalizes noncrossing set constructions, and links algebraic invariants with combinatorial objects like Catalan and parking functions.

Findings

Formulas for Hecke traces beyond type A

Construction of noncrossing sets interpolating Catalan and parking objects

New formulas for HOMFLYPT invariants of positive braid closures

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 $A$, 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 $a$-degrees of the HOMFLYPT invariants of positive braid closures, from which we construct noncrossing sets for rational Kirkman numbers.