期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Reducibility of hyperplane arrangements 被引量:3
1
作者 Guang-feng JIANG & Jian-ming YU Department of Mathematics, Beijing University of Chemical Technology, Beijing 100029, China Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China 《Science China Mathematics》 SCIE 2007年第5期689-697,共9页
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. 展开更多
关键词 hyperplane arrangement irreducible component logarithmic derivation 32S22 14N20
原文传递
An Algorithm for Reducibility of 3-arrangements
2
作者 GAO RUI-MEI PEI DONG-HE 《Communications in Mathematical Research》 CSCD 2011年第1期62-68,共7页
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 展开更多
关键词 hyperplane arrangement REDUCIBILITY FREENESS
下载PDF
Diffeomorphic types of complements of nice point arrangements in CP^l
3
作者 YAU Stephen S.-T. 《Science China Mathematics》 SCIE 2009年第12期2774-2791,共18页
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. 展开更多
关键词 diffeomorphic type hyperplane arrangement lattice isotopy 14F05 14H30
原文传递
Reducibility of finite reflection groups
4
作者 YU JianMing JIANG GuangFeng 《Science China Mathematics》 SCIE 2012年第5期947-960,共14页
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.
关键词 reflection groups hyperplane arrangement REDUCIBILITY
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部