An Algorithm For Computing The Intersection Partially Ordered Set And Its Mobius Function Of Hyperplane Arrangements

An algorithm for computing the intersection partially ordered set and its Mobius function for hyperplane arrangements is formulated. This algorithm consequently gives the characteristic polynomial of the arrangement. An algorithm for computing the characteristic polynomial of central arrangements due to Gao and Pei is generalized to that for non-central arrangements. A classification of arrangements with at most five planes in3-dimensional space was made under the L-equivalence.