加载中…
Cuntz and Kühne introduced the class of connected subgraph arrangements , depending on a graph , and classified all graphs such that the corresponding arrangement is free. We extend their result to the multiarrangement case and classify all graphs for which the corresponding arrangement supports some multiplicity such that the multiarrangement is free.

生成讲解博客的中文版本

生成AI智能校验的中文版本