supersolvable arrangement
Recently Published Documents


TOTAL DOCUMENTS

3
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2017 ◽  
Vol 15 (1) ◽  
pp. 587-594
Author(s):  
Ruimei Gao ◽  
Xiupeng Cui ◽  
Zhe Li

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.


2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Thomas McConville

International audience We introduce a poset structure on the reduced galleries in a supersolvable arrangement of hyperplanes. In particular, for Coxeter groups of type A or B, we construct a poset of reduced words for the longest element whose Hasse diagram is the graph of reduced words. Using Rambau's Suspension Lemma, we show that these posets are homotopy equivalent to spheres. We furthermore conjecture that its intervals are either homotopy equivalent to spheres or are contractible. One may view this as a analogue of a result of Edelman and Walker on the homotopy type of intervals of a poset of chambers of a hyperplane arrangement.


Sign in / Sign up

Export Citation Format

Share Document