A computational criterion for the supersolvability of line arrangements.

MaRDI QIDQ3462407zbMATH OpenFDO

Authors Stefan O. Tohǎneanu

Publication date 14 January 2016

zbMATH Keywords

minimal distancesupersolvable arrangements

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Supersolvable resolutions of line arrangements
• An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement
• On complex supersolvable line arrangements
• The supersolvable order of hyperplanes of an arrangement
• Real and complex supersolvable line arrangements in the projective plane

Cited in

(10)

• Real and complex supersolvable line arrangements in the projective plane
• On supersolvable and nearly supersolvable line arrangements
• On complex supersolvable line arrangements
• Supersolvable simplicial arrangements
• An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement
• Algebraic geometry, commutative algebra and combinatorics: interactions and open problems
• On the geometry of real or complex supersolvable line arrangements
• Unexpected curves in \(\mathbb{P}^2\), line arrangements, and minimal degree of Jacobian relations
• Supersolvable resolutions of line arrangements
• On the De Boer-Pellikaan method for computing minimum distance

This page was built for publication: A computational criterion for the supersolvability of line arrangements.

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