On the chromatic symmetric homology for star graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913456440999936 |
|---|---|
| author | Pierson, Laura |
| author_facet | Pierson, Laura |
| contents | The chromatic symmetric function $X_G$ is a power series that encodes the proper colorings of a graph $G$ by assigning a variable to each color and a monomial to each coloring such that the power of a variable in a monomial is the number of times the corresponding color is used in the corresponding coloring. The chromatic symmetric homology $H_*(G)$ is a doubly graded family of $\mathbb{C}[\mathfrak{S}_n]$-modules that was defined by Sazdanović and Yip (2018) as a categorification of $X_G$. Chandler, Sazdanović, Stella, and Yip (2023) proved that $H_*(G)$ is a strictly stronger graph invariant than $X_G$, and they also computed or conjectured formulas for it in a number of special cases. We prove and extend some of their conjectured formulas for the case of star graphs, where one central vertex is connected to all other vertices and no other pairs of vertices are connected. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_01396 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the chromatic symmetric homology for star graphs Pierson, Laura Combinatorics The chromatic symmetric function $X_G$ is a power series that encodes the proper colorings of a graph $G$ by assigning a variable to each color and a monomial to each coloring such that the power of a variable in a monomial is the number of times the corresponding color is used in the corresponding coloring. The chromatic symmetric homology $H_*(G)$ is a doubly graded family of $\mathbb{C}[\mathfrak{S}_n]$-modules that was defined by Sazdanović and Yip (2018) as a categorification of $X_G$. Chandler, Sazdanović, Stella, and Yip (2023) proved that $H_*(G)$ is a strictly stronger graph invariant than $X_G$, and they also computed or conjectured formulas for it in a number of special cases. We prove and extend some of their conjectured formulas for the case of star graphs, where one central vertex is connected to all other vertices and no other pairs of vertices are connected. |
| title | On the chromatic symmetric homology for star graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.01396 |