An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement

DOI10.6040/J.ISSN.1671-9352.0.2013.416zbMATH Open1313.05038MaRDI QIDQ2923741FDOQ2923741

Authors: Ruimei Gao, Donghe Pei 

Publication date: 3 November 2014

Published in: Journal of Shandong University. Natural Science (Search for Journal in Brave)

Recommendations

• Computing characteristic polynomials of hyperplane arrangements with symmetries
• The supersolvable order of hyperplanes of an arrangement
• scientific article; zbMATH DE number 2108153
• The counting polynomial of a supersolvable arrangement
• Roots of the characteristic polynomials of hyperplane arrangements and their restrictions and localizations
• An identity for the coefficients of characteristic polynomials of hyperplane arrangements
• A computational criterion for the supersolvability of line arrangements.
• Hyperplane arrangements: computations and conjectures
• Publication:4938820
• On supersolvable and nearly supersolvable line arrangements

zbMATH Keywords

characteristic polynomialhyperplane arrangementsupersolvability

Mathematics Subject Classification ID

Other designs, configurations (05B30) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Relations with arrangements of hyperplanes (32S22)

Cited In (4)

• Computing characteristic polynomials of hyperplane arrangements with symmetries
• A computational criterion for the supersolvability of line arrangements.
• An algorithm for reducibility of 3-arrangements
• Title not available (Why is that?)

This page was built for publication: An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement

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