Free multiderivations of connected subgraph arrangements

Abstract

Cuntz and K\"uhne introduced the class of connected subgraph arrangements AG, depending on a graph G, and classified all graphs G such that the corresponding arrangement AG is free. We extend their result to the multiarrangement case and classify all graphs G for which the corresponding arrangement AG supports some multiplicity μ such that the multiarrangement (AG,μ) is free.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…