An algorithm for computing invariant Φ3 of hyperplane arrangements is proposed, and a computer program using this algorithm is developed. As an illustration of its application, it is proved that Φ3=2m for an arrangement associated with a wheel graph with m+1 vertices.
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
References
[1]FALK M. Arrangements and cohomology[J]. Ann Comb, 1997, 1(2): 135-158.
[2]FALK M. Combinatorial and algebraic structure in orlik-solomon algebra[J]. Europ J Combinatorics, 2001,22(3):687-698.
[3]FALK M. On the algebra associated with a geometric lattice[J]. Adv
Math, 1990, 80: 152-163.
{{custom_fnGroup.title_en}}
Footnotes
{{custom_fn.content}}