2000 character limit reached
Free arrangements with low exponents
Published 22 Jul 2017 in math.CO | (1707.07091v4)
Abstract: In this article we show that any free hyperplane arrangement with exponents 1's and 2's is a supersolvable arrangement. We conjecture that any free arrangement with exponents 1's, 2's and exactly one 3, is also supersolvable, and we show this conjecture for hyperplane arrangements of ranks 4 and 5, and for inductively free arrangements of any rank.
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.