On the containment problem and sporadic simplicial line arrangements
Marek Janasz · Annales Polonici Mathematici · 2025
We present two examples of inductively free sporadic simplicial arrangements of $31$ lines that have the same weak combinatorics, which allows us to answer negatively the questions regarding the containment problem formulated recently by Drabkin and Secel