Principal $Γ$-cone for a tree

Simple item page
dc.creatorSaito, Kyoji
dc.date2005-10-28
dc.date2005-10-30
dc.date.accessioned2026-07-07T06:48:03Z
dc.date.available2026-07-07T06:48:03Z
dc.descriptionEach 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.
dc.descriptionReplaced because of a Tex compiling problem
dc.identifierhttps://arxiv.org/abs/math/0510623
dc.identifierhttp://arxiv.org/abs/math/0510623
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103857
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.titlePrincipal $Γ$-cone for a tree
dc.typetext

Files

Collections

arXiv