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 2013 · math.COShow all

1 paper · 2 filters

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…