Free but not recursively free arrangements
classification
🧮 math.AG
math.CO
keywords
freerecursivelyarrangementintersectionlatticearrangementscharacteristiccombinatorial
read the original abstract
We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus recursive freeness is not a combinatorial property of the intersection lattice of an arrangement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.