Skip to Main content Skip to Navigation

# Permutation patterns, Stanley symmetric functions, and the Edelman-Greene correspondence

Abstract : Generalizing the notion of a vexillary permutation, we introduce a filtration of $S_{\infty}$ by the number of Edelman-Greene tableaux of a permutation, and show that each filtration level is characterized by avoiding a finite set of patterns. In doing so, we show that if $w$ is a permutation containing $v$ as a pattern, then there is an injection from the set of Edelman-Greene tableaux of $v$ to the set of Edelman-Greene tableaux of $w$ which respects inclusion of shapes. We also consider the set of permutations whose Edelman-Greene tableaux have distinct shapes, and show that it is closed under taking patterns.
Keywords :
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]

https://hal.inria.fr/hal-01229705
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Tuesday, November 17, 2015 - 10:20:17 AM
Last modification on : Friday, June 28, 2019 - 2:24:04 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:42:00 AM

### File

dmAS0118.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01229705, version 1

### Citation

Sara Billey, Brendan Pawlowski. Permutation patterns, Stanley symmetric functions, and the Edelman-Greene correspondence. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.205-216. ⟨hal-01229705⟩

Record views

Files downloads