Signed graphs and the freeness of the Weyl subarrangements of type B_
Abstract
A Weyl arrangement is the hyperplane arrangement defined by a root system. Arnold and Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type A are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of thier graph. In addition, The Weyl subarrangements of type B can be represented by signed graphs. A characterization of freeness for them is not known. However, characterizations of freeness for a few restricted classes are known. For instance, Edelman and Reiner characterized the freeness of the arrangements between type A-1 and type B . In this paper, we give a characterization of the freeness and supersolvability of the Weyl subarrangements of type B under certain assumption.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.