A bijective proof of Macdonald's reduced word formula
1 : Department of Mathematics [Seattle]
University of Washington Department of Mathematics Box 354350 Seattle, WA 98195-4350 -
États-Unis
3 : Department of Mathematics, University of Oregon [Eugene]
-
Website
Eugene OR 97403 USA -
États-Unis
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.
| Subject : | : | Talk |
| Topics | : | Combinatorics |
| PDF version | : |  PDF version |
- Poster
