Principal $Γ$-cone for a tree

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Each orientation on a Dynkin graph $Γ$ defines a cone (in a certain real configuration space) which is further divided into chambers. We enumerate the number of chambers for two particular cones, which are called the pricipal $Γ$-cones and are attached to bipartite decompositions of $Γ$, by a use of hook length formulae. We prove that these pricipal cones are characterized by the maximality of the number of chambers in them.
Replaced because of a Tex compiling problem

Keywords

Combinatorics, Representation Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/103857

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0510623
 http://arxiv.org/abs/math/0510623

Collections

arXiv