A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Supersolvable orders and inductively free arrangements
2017
Open Mathematics
Preserved Fulltext
AbstractIn this paper, we define the supersolvable order of hyperplanes in a supersolvable arrangement, and obtain a class of inductively free arrangements according to this order. Our main results improve the conclusion that every supersolvable arrangement is inductively free. In addition, we assert that the inductively free arrangement with the required induction table is supersolvable.
doi:10.1515/math-2017-0052
fatcat:f6t4kjqo6jbztpfxgpqo4och5i