Remarks on umbral evaluations of chromatic polynomials (Q1318843): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3050437 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3254323 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5519913 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coclosure operators and chromatic polynomials. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Number of Partitions of a Set / rank | |||
Normal rank |
Latest revision as of 14:23, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Remarks on umbral evaluations of chromatic polynomials |
scientific article |
Statements
Remarks on umbral evaluations of chromatic polynomials (English)
0 references
4 April 1994
0 references
The author has studied the polynomial \(\chi (u) = a_ 1u^ 1+ a_ 2u^ 2 + \cdots + a_ nu^ n\) which generalizes the concept of chromatic polynomial of graphs. It is shown that a suitable umbral evaluation \(a_ 1u_ 1+ a_ 2u_ 2 + \cdots + a_ nu_ n\) of the polynomial gives the solution of a class of coloring enumeration problems depending on a group action on the set of colors. These results are obtained using the Pólya-de Bruijn theory. Applications include proofs of several formulas for \(B_ n\), the number of partitions of an \(n\)-set.
0 references
chromatic polynomial
0 references
umbral evaluation
0 references
coloring enumeration problems
0 references
Pólya-de Bruijn theory
0 references
number of partitions
0 references