activity
20132018
most citedOn the -problem for restrictions of complex reflection arrangements

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

math.CO2013

Supersolvable restrictions of reflection arrangements

N. Amend, T. Hoge, G. Roehrle

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvabl…

math.GR2013

On inductively free Restrictions of Reflection Arrangements

Nils Amend, Torsten Hoge, Gerhard Roehrle

Let W be a finite complex reflection group acting on the complex vector space V and let A(W) = (A(W), V) be the associated reflection arrangement. In an earlier paper by the last t…