
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.
supersolvable arrangement, free arrangement, inductively free arrangement, Relations with arrangements of hyperplanes, QA1-939, supersolvable order, 52c35, 32s22, Mathematics, Arrangements of points, flats, hyperplanes (aspects of discrete geometry)
supersolvable arrangement, free arrangement, inductively free arrangement, Relations with arrangements of hyperplanes, QA1-939, supersolvable order, 52c35, 32s22, Mathematics, Arrangements of points, flats, hyperplanes (aspects of discrete geometry)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
