The proof constructs a bijection in braid varieties, revealing enumerative patterns in vertex-labeled trees.
We construct a bijection between certain Deodhar components of a braid variety constructed from an affine Kac–Moody group of type A n-1 and vertex-labeled trees on n vertices. By an argument of Galashin, Lam, and Williams using Opdam’s trace formula in the affine Hecke algebra and an identity due to Haglund, we obtain an elaborate new proof for the enumeration of the number of vertex-labeled trees on n vertices.
No takes yet. Share an insight, caveat, or question.
Banaian et al. (2025) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: