2000 character limit reached
Divisionally free Restrictions of Reflection Arrangements
Published 1 Oct 2015 in math.CO and math.GR | (1510.00213v2)
Abstract: We study some aspects of divisionally free arrangements which were recently introduced by Abe. Crucially, Terao's conjecture on the combinatorial nature of freeness holds within this class. We show that while it is compatible with products, surprisingly, it is not closed under taking localizations. In addition, we determine all divisionally free restrictions of all reflection arrangements.
Sponsor
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.