Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Balanced labellings of affine permutations

Abstract : We study the $\textit{diagrams}$ of affine permutations and their $\textit{balanced}$ labellings. As in the finite case, which was investigated by Fomin, Greene, Reiner, and Shimozono, the balanced labellings give a natural encoding of reduced decompositions of affine permutations. In fact, we show that the sum of weight monomials of the $\textit{column strict}$ balanced labellings is the affine Stanley symmetric function defined by Lam and we give a simple algorithm to recover reduced words from balanced labellings. Applying this theory, we give a necessary and sufficient condition for a diagram to be an affine permutation diagram. Finally, we conjecture that if two affine permutations are $\textit{diagram equivalent}$ then their affine Stanley symmetric functions coincide.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Tuesday, November 17, 2015 - 10:19:23 AM
Last modification on : Tuesday, March 7, 2017 - 3:22:42 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:31:20 AM


Publisher files allowed on an open archive




Hwanchul yoo, Taedong yun. Balanced labellings of affine permutations. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.779-790, ⟨10.46298/dmtcs.2342⟩. ⟨hal-01229656⟩



Record views


Files downloads