2000 character limit reached
On inductively free Restrictions of Reflection Arrangements
Published 7 Oct 2013 in math.GR and math.CO | (1310.1708v2)
Abstract: 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 two authros, we classified all inductively free reflection arrangements A(W). The aim of this note is to extend this work by determining all inductively free restrictions of reflection arrangements.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.