Paper Info
Title
A Computational Criterion For The Supersolvability Of Line Arrangements.
Abstract
In this note we find a necessary and sufficient condition for the supersolvability of an essential, central arrangement of rank 3 (i.e., line arrangement in the projective plane). We present an algorithmic way to decide if such an arrangement is supersolvable or not that does not require an ordering of the lines as the Bjorner-Ziegler's and Peeva's criteria require. The method uses the duality between points and lines in the projective plane in the context of coding theory.
Year
Venue
Keywords
2014
ARS COMBINATORIA
supersolvable arrangements,minimal distance
Field
DocType
Volume
Discrete mathematics,Mathematics
Journal
117
ISSN
Citations 
PageRank 
0381-7032
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Stefan O. Tohaneanu1155.03