An Algorithm for Reducibility of 3-arrangements  

作　　者：GAO RUI-MEI PEI DONG-HE 

机构地区：[1]School of Mathematics and Statistics, Northeast Normal University, Changchun, 130024

出　　处：《Communications in Mathematical Research》2011年第1期62-68,共7页数学研究通讯（英文版）

基　　金：The NSF(10871035)of China

摘　　要：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 givenWe 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 

分 类 号：O177.1[理学—数学] TP301.6[理学—基础数学]