On the containment problem and sporadic simplicial line arrangements
Marek Janasz
TL;DR
The paper addresses the containment problem between symbolic powers and ordinary powers of radical ideals associated with line-arrangement singular loci, building on questions by Drabkin and Seceleanu. It constructs two non-isomorphic inductively free simplicial arrangements with 31 lines that share the same weak combinatorics, demonstrating that $(J(\mathcal{A}))^{(3)} \subseteq (J(\mathcal{A}))^2$ holds for one but fails for the other, thus giving a negative answer. The constructions rely on explicit line equations and an inductive freeness analysis (via Addition–Deletion), with computational verification in SINGULAR. The results show that inductive freeness, even in the simplicial setting, does not control the containment between symbolic and ordinary powers, prompting further study of recursively free arrangements and the nuanced relationship between combinatorics and algebraic containment.
Abstract
In the paper we present two examples of inductively free sporadic simplicial arrangements of 31 lines that are non-isomorphic, which allow us to answer negatively questions on the containment problem recently formulated by Drabkin and Seceleanu.
