An algorithm for invariant Φ3 of hyperplane arrangements

ZHANG Xi;JIANG GuangFeng*

Journal of Beijing University of Chemical Technology ›› 2007, Vol. 34 ›› Issue (4) : 446-448.

PDF(430 KB)
Welcome to Journal of Beijing University of Chemical Technology, Today is February 21, 2025
Email Alert  RSS
PDF(430 KB)
Journal of Beijing University of Chemical Technology ›› 2007, Vol. 34 ›› Issue (4) : 446-448.
管理与数理科学

An algorithm for invariant Φ3 of hyperplane arrangements

  • ZHANG Xi;JIANG GuangFeng*
Author information +
History +

Abstract

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. 

Cite this article

Download Citations
ZHANG Xi;JIANG GuangFeng*. An algorithm for invariant Φ3 of hyperplane arrangements[J]. Journal of Beijing University of Chemical Technology, 2007, 34(4): 446-448

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.
PDF(430 KB)

Accesses

Citation

Detail

Sections
Recommended

/