Reducibility of hyperplane arrangements

CSpace > 数学所

	Reducibility of hyperplane arrangements
	Guangfeng JIANG 1; Jianming YU2
	2007
发表期刊	Science in China. Series A: Mathematics
ISSN	1006-9283
卷号	50 期号:5 页码:689
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/5084
专题	数学所
作者单位	1.北京化工大学 2.中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Guangfeng JIANG,Jianming YU. Reducibility of hyperplane arrangements[J]. Science in China. Series A: Mathematics,2007,50(5):689.
APA	Guangfeng JIANG,&Jianming YU.(2007).Reducibility of hyperplane arrangements.Science in China. Series A: Mathematics,50(5),689.
MLA	Guangfeng JIANG,et al."Reducibility of hyperplane arrangements".Science in China. Series A: Mathematics 50.5(2007):689.