Open Mathematics (May 2017)

Supersolvable orders and inductively free arrangements

  • Gao Ruimei,
  • Cui Xiupeng,
  • Li Zhe

DOI
https://doi.org/10.1515/math-2017-0052
Journal volume & issue
Vol. 15, no. 1
pp. 587 – 594

Abstract

Read online

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.

Keywords