Principal Γ-cone for a tree
Kyoji Saito
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.