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.展开更多
We consider a central hyperplane arrangement in a three-dimensional vector space. The definition of characteristic form to a hyperplane arrangement is given and we could make use of characteristic form to judge the re...We consider a central hyperplane arrangement in a three-dimensional vector space. The definition of characteristic form to a hyperplane arrangement is given and we could make use of characteristic form to judge the reducibility of this arrangement. In addition, the relationship between the reducibility and freeness of a hyperplane arrangement is given展开更多
We use a new method to study arrangement in CPl,define a class of nice point arrangements and show that if two nice point arrangements have the same combinatorics,then their complements are diffeomorphic to each other...We use a new method to study arrangement in CPl,define a class of nice point arrangements and show that if two nice point arrangements have the same combinatorics,then their complements are diffeomorphic to each other.In particular,the moduli space of nice point arrangements with same combinatorics in CPl is connected.It generalizes the result on point arrangements in CP3 to point arrangements in CPl for any l.展开更多
A finite (pseudo-)reflection group G naturally gives rise to a hyperplane arrangement,i.e.,its reflection arrangement.We show that G is reducible if and only if its reflection arrangement is reducible.
基金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.
文摘We consider a central hyperplane arrangement in a three-dimensional vector space. The definition of characteristic form to a hyperplane arrangement is given and we could make use of characteristic form to judge the reducibility of this arrangement. In addition, the relationship between the reducibility and freeness of a hyperplane arrangement is given
基金supported by National Natural Science Foundation of China(Grant No.10731030)Program of Shanghai Subject Chief Scientist (PSSCS) of Shanghai
文摘We use a new method to study arrangement in CPl,define a class of nice point arrangements and show that if two nice point arrangements have the same combinatorics,then their complements are diffeomorphic to each other.In particular,the moduli space of nice point arrangements with same combinatorics in CPl is connected.It generalizes the result on point arrangements in CP3 to point arrangements in CPl for any l.
基金supported by National Natural Science Foundation of China(Grant No. 11071010)
文摘A finite (pseudo-)reflection group G naturally gives rise to a hyperplane arrangement,i.e.,its reflection arrangement.We show that G is reducible if and only if its reflection arrangement is reducible.