In 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.
@article{bwmeta1.element.doi-10_1515_math-2017-0052,
author = {Ruimei Gao and Xiupeng Cui and Zhe Li},
title = {Supersolvable orders and inductively free arrangements},
journal = {Open Mathematics},
volume = {15},
year = {2017},
pages = {587-594},
zbl = {06715930},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2017-0052}
}
Ruimei Gao; Xiupeng Cui; Zhe Li. Supersolvable orders and inductively free arrangements. Open Mathematics, Tome 15 (2017) pp. 587-594. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2017-0052/