scholarly journals Chromatic symmetric function of graphs from Borcherds algebras

2021 ◽  
Vol 183 ◽  
pp. 105492
Author(s):  
G. Arunkumar
Keyword(s):  
Symmetric Function ◽  
Chromatic Symmetric Function

scholarly journals A Quasisymmetric Function Generalization of the Chromatic Symmetric Function

10.37236/518 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Brandon Humpert
Keyword(s):  
Symmetric Function ◽  
Chromatic Polynomial ◽  
Quasisymmetric Function ◽  
Quasisymmetric Functions ◽  
Acyclic Orientations ◽  
Chromatic Symmetric Function

The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the fundamental basis for the quasisymmetric functions. Following the specialization of $X_G$ to $\chi_G(\lambda)$, the chromatic polynomial, we also define a generalization $\chi^k_G(\lambda)$ and show that evaluations of this polynomial for negative values generalize a theorem of Stanley relating acyclic orientations to the chromatic polynomial.

scholarly journals Power Sum Expansion of Chromatic Quasisymmetric Functions

10.37236/4761 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Christos A. Athanasiadis
Keyword(s):  
Symmetric Group ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Unit Interval ◽  
Quasisymmetric Function ◽  
Interval Order ◽  
Combinatorial Formula ◽  
Natural Unit ◽  
Power Sum ◽  
Chromatic Symmetric Function

The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley's chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof uses a formula of Roichman for the irreducible characters of the symmetric group.

scholarly journals A categorification of the chromatic symmetric polynomial

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Radmila Sazdanović ◽  
Martha Yip
Keyword(s):  
Symmetric Function ◽  
Symmetric Polynomial ◽  
Chromatic Polynomial ◽  
Khovanov Homology ◽  
Symmetric Polynomials ◽  
Nous Obtenons ◽  
Combinatorial Properties ◽  
International Audience ◽  
Chromatic Symmetric Function ◽  
Frobenius Series

International audience The Stanley chromatic polynomial of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology $H$<sub>*</sub>($G$) of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to the chromatic symmetric function at $q=t=1$. We also obtain analogues of several familiar properties of the chromatic symmetric polynomials in terms of homology. Le polynôme chromatique symétrique d’un graphe $G$ est une généralisation par une fonction symétrique du polynôme chromatique, et possède des propriétés combinatoires intéressantes. Nous appliquons les techniques de l’homologie de Khovanov pour construire une homologie $H$<sub>*</sub>($G$) de modules gradués $S_n$, dont la série bigraduée de Frobeniusse $Frob_G(q,t)$ réduit au polynôme chromatique symétrique à $q=t=1$. Nous obtenons également des analogies pour plusieurs propriétés connues des polynômes chromatiques en termes d’homologie.

scholarly journals Proper caterpillars are distinguished by their chromatic symmetric function

2014 ◽  
Vol 315-316 ◽  
pp. 158-164 ◽  
Author(s):  
José Aliste-Prieto ◽  
José Zamora
Keyword(s):  
Symmetric Function ◽  
Chromatic Symmetric Function

scholarly journals Plurigraph Coloring and Scheduling Problems

10.37236/6818 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
John Machacek
Keyword(s):  
Symmetric Function ◽  
Degree Sequence ◽  
Simplicial Complexes ◽  
Vertex Coloring ◽  
Scheduling Problems ◽  
Acyclic Coloring ◽  
New Type ◽  
Star Coloring ◽  
Chromatic Symmetric Function ◽  
Special Case

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs this symmetric function in noncommuting variables agrees with the chromatic symmetric function in noncommuting variables of Gebhard and Sagan. Our vertex coloring is a special case of the scheduling problems defined by Breuer and Klivans. We show how the deletion-contraction law can be applied to scheduling problems. Also, we show that the chromatic symmetric function determines the degree sequence of uniform hypertrees, but there exists pairs of 3-uniform hypertrees which are not isomorphic yet have the same chromatic symmetric function.

scholarly journals Coloring Rings in Species

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Jacob White
Keyword(s):  
Directed Graph ◽  
Symmetric Function ◽  
Chromatic Polynomial ◽  
Connected Components ◽  
Expansion Formula ◽  
Strongly Connected Components ◽  
Set Partitions ◽  
Strongly Connected ◽  
International Audience ◽  
Chromatic Symmetric Function

International audience We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species. The primary examples are graphs and set partitions. For these new invariants, we present analogues of results regarding stable partitions, the bond lattice, the deletion-contraction recurrence, and the subset expansion formula. We also present two detailed examples, one related to enumerating subgraphs by their blocks, and a second example related to enumerating subgraphs of a directed graph by their strongly connected components.

scholarly journals Chromatic Symmetric Functions of Hypertrees

10.37236/5369 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Jair Taylor
Keyword(s):  
Symmetric Function ◽  
Symmetric Functions ◽  
Combinatorial Interpretation ◽  
Quasisymmetric Functions ◽  
Chromatic Symmetric Function

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$.

Sign in / Sign up

Export Citation Format

Share Document