An algorithm for reducibility of 3-arrangements

MaRDI QIDQ3109312zbMATH OpenFDO

Authors Ruimei Gao, Donghe Pei

Publication date 27 January 2012

zbMATH Keywords

freenesshyperplane arrangement

Mathematics Subject Classification ID

Relations with arrangements of hyperplanes (32S22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• Reducibility of hyperplane arrangements
• ON THE FREENESS OF 3-ARRANGEMENTS
• An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement
• Free arrangements over finite field
• ARRANGEMENTS OF HYPERPLANES IN ℝ³AND THEIR FREENESS

Cited in

(2)

• scientific article; zbMATH DE number 1223434 (Why is no real title available?)
• An efficient algorithm for 3NF determination

This page was built for publication: An algorithm for reducibility of 3-arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109312)