English

Free multiderivations of connected subgraph arrangements

Combinatorics 2025-10-21 v3

Abstract

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

Keywords

Cite

@article{arxiv.2406.19866,
  title  = {Free multiderivations of connected subgraph arrangements},
  author = {Paul Mücksch and Gerhard Roehrle and Sven Wiesner},
  journal= {arXiv preprint arXiv:2406.19866},
  year   = {2025}
}

Comments

25 pages, 2 figures; v2 updated acknowledgments; v3 final version; to appear in Annali della Scuola Normale Superiore di Pisa, Classe di Scienze