Characterizing Nice Partition of Graphical 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_ | 1866914157988675584 |
|---|---|
| author | Liang, Weikang Wang, Suijie Zhao, Chengdong |
| author_facet | Liang, Weikang Wang, Suijie Zhao, Chengdong |
| contents | The successive works of Terao as well as Stanley revealed that, for graphical arrangements, supersolvability and the existence of nice partitions are equivalent properties, both characterized by chordal graphs. In this paper, we further prove that every nice partition of a graphical arrangement arises precisely from a maximal modular chain in its intersection lattice. Moreover, we establish two converses to classical results of Orlik and Terao on nice partitions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06645 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Characterizing Nice Partition of Graphical Arrangements Liang, Weikang Wang, Suijie Zhao, Chengdong Combinatorics The successive works of Terao as well as Stanley revealed that, for graphical arrangements, supersolvability and the existence of nice partitions are equivalent properties, both characterized by chordal graphs. In this paper, we further prove that every nice partition of a graphical arrangement arises precisely from a maximal modular chain in its intersection lattice. Moreover, we establish two converses to classical results of Orlik and Terao on nice partitions. |
| title | Characterizing Nice Partition of Graphical Arrangements |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.06645 |