On the containment problem and sporadic simplicial line arrangements
Annales Polonici Mathematici
MSC: Primary 14N20; Secondary 13A15, 52A20
DOI: 10.4064/ap240408-18-9
Opublikowany online: 25 February 2025
Streszczenie
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 Seceleanu.
