DOAJ Open Access 2020

A bijective proof of Macdonald's reduced word formula

Sara Billey Alexander Holroyd Benjamin Young

Lihat Sumber DOI

Abstrak

We describe a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. The proof extends to a principal specialization of the identity due to Fomin and Stanley. Our bijective tools also allow us to address a problem posed by Fomin and Kirillov from 1997, using work of Wachs, Lenart and Serrano- Stump.

Topik & Kata Kunci

Mathematics

Penulis (3)

Sara Billey

Alexander Holroyd

Benjamin Young

Format Sitasi

APA MLA BibTeX

Billey, S., Holroyd, A., Young, B. (2020). A bijective proof of Macdonald's reduced word formula. https://doi.org/10.46298/dmtcs.6412

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.6412

Informasi Jurnal

Tahun Terbit: 2020
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.6412
Akses: Open Access ✓