# 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.
Keywords :
Document type :
Conference papers

Cited literature [12 references]

https://hal.inria.fr/hal-01229656
Contributor : Alain Monteil <>
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

### File

dmAS0166.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01229656, version 1

### Citation

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. ⟨hal-01229656⟩

Record views