Principal -cone for a tree
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.