共查询到20条相似文献,搜索用时 31 毫秒
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
《Discrete Mathematics》2019,342(10):2834-2842
13.
《Discrete Mathematics》2019,342(1):233-249
A Weyl arrangement is the hyperplane arrangement defined by a root system. Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of their graph. In addition, the Weyl subarrangements of type 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 and type . In this paper, we give a characterization of the freeness and supersolvability of the Weyl subarrangements of type under certain assumption. 相似文献
14.
15.
16.
17.
18.
19.