Free multiderivations of connected subgraph arrangements
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909858089926656 |
|---|---|
| author | Mücksch, Paul Roehrle, Gerhard Wiesner, Sven |
| author_facet | Mücksch, Paul Roehrle, Gerhard Wiesner, Sven |
| contents | Cuntz and Kühne 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 $μ$ such that the multiarrangement $(A_G,μ)$ is free. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_19866 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Free multiderivations of connected subgraph arrangements Mücksch, Paul Roehrle, Gerhard Wiesner, Sven Combinatorics 51F15, 52C35, 32S22 Cuntz and Kühne 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 $μ$ such that the multiarrangement $(A_G,μ)$ is free. |
| title | Free multiderivations of connected subgraph arrangements |
| topic | Combinatorics 51F15, 52C35, 32S22 |
| url | https://arxiv.org/abs/2406.19866 |