English

Principal $\Gamma$-cone for a tree

Combinatorics 2007-05-23 v2 Representation Theory

Abstract

Each orientation on a Dynkin graph Γ\Gamma 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 Γ\Gamma-cones and are attached to bipartite decompositions of Γ\Gamma, 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.

Cite

@article{arxiv.math/0510623,
  title  = {Principal $\Gamma$-cone for a tree},
  author = {Kyoji Saito},
  journal= {arXiv preprint arXiv:math/0510623},
  year   = {2007}
}

Comments

Replaced because of a Tex compiling problem