The braid and the Shi arrangements and the Pak-Stanley labelling
In this article we study a construction, due to Pak and Stanley, with which every region R of the Shi arrangement is (bijectively) labelled with a parking function lambda(R). In particular, we construct an algorithm that returns Rout of lambda(R). This is done by relating lambda to another bijection...
Autor principal: | |
---|---|
Outros Autores: | |
Formato: | article |
Idioma: | eng |
Publicado em: |
2015
|
Assuntos: | |
Texto completo: | https://repositorio-aberto.up.pt/handle/10216/116940 |
País: | Portugal |
Oai: | oai:repositorio-aberto.up.pt:10216/116940 |