Certain problems on reducibility of central hyperplane arrangements are settled. Firstly, a necessary and sufficient condition on reducibility is obtained. More precisely, it is proved that the number of irreducible c...Certain problems on reducibility of central hyperplane arrangements are settled. Firstly, a necessary and sufficient condition on reducibility is obtained. More precisely, it is proved that the number of irreducible components of a central hyperplane arrangement equals the dimension of the space consisting of the logarithmic derivations of the arrangement with degree zero or one. Secondly, it is proved that the decomposition of an arrangement into a direct sum of its irreducible components is unique up to an isomorphism of the ambient space. Thirdly, an effective algorithm for determining the number of irreducible components and decomposing an arrangement into a direct sum of its irreducible components is offered. This algorithm can decide whether an arrangement is reducible, and if it is the case, what the defining equations of irreducible components are.展开更多
基金the National Natural Science Foundation of China (Grant No. 10671009)
文摘Certain problems on reducibility of central hyperplane arrangements are settled. Firstly, a necessary and sufficient condition on reducibility is obtained. More precisely, it is proved that the number of irreducible components of a central hyperplane arrangement equals the dimension of the space consisting of the logarithmic derivations of the arrangement with degree zero or one. Secondly, it is proved that the decomposition of an arrangement into a direct sum of its irreducible components is unique up to an isomorphism of the ambient space. Thirdly, an effective algorithm for determining the number of irreducible components and decomposing an arrangement into a direct sum of its irreducible components is offered. This algorithm can decide whether an arrangement is reducible, and if it is the case, what the defining equations of irreducible components are.
