Supersolvable orders and inductively free arrangements

Ruimei Gao; Xiupeng Cui; Zhe Li

Open Mathematics (2017)

  • Volume: 15, Issue: 1, page 587-594
  • ISSN: 2391-5455

Abstract

top
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.

How to cite

top

Ruimei Gao, Xiupeng Cui, and Zhe Li. "Supersolvable orders and inductively free arrangements." Open Mathematics 15.1 (2017): 587-594. <http://eudml.org/doc/288118>.

@article{RuimeiGao2017,
abstract = {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.},
author = {Ruimei Gao, Xiupeng Cui, Zhe Li},
journal = {Open Mathematics},
keywords = {Free arrangement; Inductively free arrangement; Supersolvable arrangement; Supersolvable order; free arrangement; inductively free arrangement; supersolvable arrangement; supersolvable order},
language = {eng},
number = {1},
pages = {587-594},
title = {Supersolvable orders and inductively free arrangements},
url = {http://eudml.org/doc/288118},
volume = {15},
year = {2017},
}

TY - JOUR
AU - Ruimei Gao
AU - Xiupeng Cui
AU - Zhe Li
TI - Supersolvable orders and inductively free arrangements
JO - Open Mathematics
PY - 2017
VL - 15
IS - 1
SP - 587
EP - 594
AB - 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.
LA - eng
KW - Free arrangement; Inductively free arrangement; Supersolvable arrangement; Supersolvable order; free arrangement; inductively free arrangement; supersolvable arrangement; supersolvable order
UR - http://eudml.org/doc/288118
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.