English

An elaborate new proof of Cayley's formula

Combinatorics 2024-02-13 v1

Abstract

We construct a bijection between certain Deodhar components of a braid variety constructed from an affine Kac-Moody group of type An1A_{n-1} and vertex-labeled trees on nn 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 nn vertices.

Keywords

Cite

@article{arxiv.2402.07798,
  title  = {An elaborate new proof of Cayley's formula},
  author = {Esther Banaian and Anh Trong Nam Hoang and Elizabeth Kelley and Weston Miller and Jason Stack and Carolyn Stephen and Nathan Williams},
  journal= {arXiv preprint arXiv:2402.07798},
  year   = {2024}
}

Comments

21 pages