2000 character limit reached
Free multiderivations of connected subgraph arrangements
Published 28 Jun 2024 in math.CO | (2406.19866v2)
Abstract: Cuntz and K\"uhne introduced the class of connected subgraph arrangements $A_G$, depending on a graph $G$, and classified all graphs $G$ such that the corresponding arrangement $A_G$ is free. We extend their result to the multiarrangement case and classify all graphs $G$ for which the corresponding arrangement $A_G$ supports some multiplicity $\mu$ such that the multiarrangement $(A_G,\mu)$ is free.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.