REVIEW 1 cited by
Chromatic bases for symmetric functions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this note we obtain numerous new bases for the algebra of symmetric functions whose generators are chromatic symmetric functions. More precisely, if $\{ G_ k \}_{k\geq 1}$ is a set of connected graphs such that $G_k$ has $k$ vertices for each $k$, then the set of all chromatic symmetric functions $\{ X_{G_ k} \}_{k\geq 1}$ generates the algebra of symmetric functions. We also obtain explicit expressions for the generators arising from complete graphs, star graphs, path graphs and cycle graphs.
Forward citations
Cited by 1 Pith paper
-
On Calculating the Chromatic Symmetric Function
The paper defines route operations that relate chromatic symmetric functions of graphs, proves forest graphs form a basis for symmetric functions by a combinatorial argument, and derives a subgraph-counting formula fo...
Discussion (0). Continue with ORCID to comment.