定义了超平面构形的一个不变量Фn,它是Falk的Фn不变量的一个推广。研究了一类特殊的图构形,它们所对应的图由l个n边形组成,使其相邻两个n边形有一条公共边,这种图叫做长度为l的n边梯子,通过逻辑推导与论证得出关于n边梯子构形的九不变量的结论Фn=(n-1)l。
An invariant Фn of hyperplane arrangements is defined, which is a generalization of invariant Ф3 defined by Falk. A special class of graphic arrangements are studied, which are determined by a kind of graphs called nedge ladder. This kind of graphs consist of l polygons and each two adjacent polygons have a common edge. And it is proved that Фn = (n - 1)l for n-edge ladder arrangements through logical calculation and demonstration.