Chromatic symmetric functions of hypertrees (Q528973): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Summary: The chromatic symmetric function \(X_H\) of a hypergraph \(H\) is the sum of all monomials corresponding to proper colorings of \(H\). When \(H\) is an ordinary graph, it is known that \(X_H\) is positive in the fundamental quasisymmetric functions \(F_S\), but this is not the case for general hypergraphs. We exhibit a class of hypergraphs \(H\) -- hypertrees with prime-sized edges -- for which \(X_H\) is \(F\)-positive, and give an explicit combinatorial interpretation for the \(F\)-coefficients of \(X_H\). | |||
Property / review text: Summary: The chromatic symmetric function \(X_H\) of a hypergraph \(H\) is the sum of all monomials corresponding to proper colorings of \(H\). When \(H\) is an ordinary graph, it is known that \(X_H\) is positive in the fundamental quasisymmetric functions \(F_S\), but this is not the case for general hypergraphs. We exhibit a class of hypergraphs \(H\) -- hypertrees with prime-sized edges -- for which \(X_H\) is \(F\)-positive, and give an explicit combinatorial interpretation for the \(F\)-coefficients of \(X_H\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6719972 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
symmetric function | |||
Property / zbMATH Keywords: symmetric function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quasisymmetric function | |||
Property / zbMATH Keywords: quasisymmetric function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
chromatic symmetric function | |||
Property / zbMATH Keywords: chromatic symmetric function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph colouring | |||
Property / zbMATH Keywords: graph colouring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypergraph | |||
Property / zbMATH Keywords: hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypertree | |||
Property / zbMATH Keywords: hypertree / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SageMath / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1506.08262 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proper caterpillars are distinguished by their chromatic symmetric function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A chromatic symmetric function in noncommuting variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5187293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraphs and a functional equation of Bouwkamp and de Bruijn / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting permutations with given cycle structure and descent set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On distinguishing trees by their chromatic symmetric functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic quasisymmetric functions and Hessenberg varieties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic quasisymmetric functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ordered structures and partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A symmetric function generalization of the chromatic polynomial of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4236280 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2803333 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:35, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Chromatic symmetric functions of hypertrees |
scientific article |
Statements
Chromatic symmetric functions of hypertrees (English)
0 references
18 May 2017
0 references
Summary: The chromatic symmetric function \(X_H\) of a hypergraph \(H\) is the sum of all monomials corresponding to proper colorings of \(H\). When \(H\) is an ordinary graph, it is known that \(X_H\) is positive in the fundamental quasisymmetric functions \(F_S\), but this is not the case for general hypergraphs. We exhibit a class of hypergraphs \(H\) -- hypertrees with prime-sized edges -- for which \(X_H\) is \(F\)-positive, and give an explicit combinatorial interpretation for the \(F\)-coefficients of \(X_H\).
0 references
symmetric function
0 references
quasisymmetric function
0 references
chromatic symmetric function
0 references
graph colouring
0 references
hypergraph
0 references
hypertree
0 references