3 problems

Let $G$ be a connected graph, and let ${\mathscr A}_G$ denote its connected subgraph arrangement. For an arrangement ${\mathscr A}$, $k$-formality is the hierarchy of formality pro…

Let $G$ be a connected graph, and let ${\mathscr A}_G$ denote its connected subgraph arrangement. A free arrangement is flag-accurate if it is accurate and the tuple of flats witne…

Let $G$ be a connected graph, and let ${\mathscr A}_G$ denote its connected subgraph arrangement. An arrangement is inductively free if it belongs to the class of arrangements obta…