中文
相关论文

相关论文: A composition method for neat formulas of chromati…

200 篇论文

The $e$-positivity conjecture and the $e$-unimodality conjecture of chromatic quasisymmetric functions are proved for some classes of natural unit interval orders. Recently, J. Shareshian and M. Wachs introduced chromatic quasisymmetric…

组合数学 · 数学 2017-11-28 Soojin Cho , JiSun Huh

In 1995 Stanley introduced the chromatic symmetric function $X_G$ of a graph $G$, whose $e$-positivity and Schur-positivity has been of large interest. In this paper we study the relative $e$-positivity and Schur-positivity between…

组合数学 · 数学 2020-03-16 Samantha Dahlberg , Adrian She , Stephanie van Willigenburg

Tatsuyuki Hikita recently proved the Stanley--Stembridge conjecture using probabilistic methods, showing that the chromatic symmetric functions of unit interval graphs are $e$-positive. Finding a combinatorial interpretation for these…

组合数学 · 数学 2026-02-18 Isaiah Siegl

We introduce $H$-chromatic symmetric functions, $X_{G}^{H}$, which use the $H$-coloring of a graph $G$ to define a generalization of Stanley's chromatic symmetric functions. We say two graphs $G_1$ and $G_2$ are $H$-chromatically equivalent…

组合数学 · 数学 2022-05-23 Nancy Mae Eagles , Angèle M. Foley , Alice Huang , Elene Karangozishvili , Annan Yu

We provide a construction for the kromatic symmetric function $\overline{X}_G$ of a graph introduced by Crew, Pechenik, and Spirkl using combinatorial (linearly compact) Hopf algebras. As an application, we show that $\overline{X}_G$ has a…

组合数学 · 数学 2025-03-18 Eric Marberg

We extend the definition of the chromatic symmetric function $X_G$ to include graphs $G$ with a vertex-weight function $w : V(G) \rightarrow \mathbb{N}$. We show how this provides the chromatic symmetric function with a natural…

组合数学 · 数学 2020-01-16 Logan Crew , Sophie Spirkl

We introduce a quasisymmetric refinement of Stanley's chromatic symmetric function. We derive refinements of both Gasharov's Schur-basis expansion of the chromatic symmetric function and Chow's expansion in Gessel's basis of fundamental…

组合数学 · 数学 2016-03-30 John Shareshian , Michelle L. Wachs

The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…

组合数学 · 数学 2016-07-12 Jonah Blasiak , Sergey Fomin

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…

组合数学 · 数学 2024-08-05 Laura Pierson

We obtain the Schur positivity of spider graphs of the forms $S(a,2,1)$ and $S(a,4,1)$, which are considered to have the simpliest structures for which the Schur positivity was unknown. The proof outline has four steps. First, we find…

组合数学 · 数学 2023-05-16 Jean-Yves Thibon , David G. L. Wang

This article is dedicated to the study of positivity phenomena for the chromatic symmetric function of a graph with respect to various bases of symmetric functions. We give a new proof of Gasharov's theorem on the Schur-positivity of the…

组合数学 · 数学 2017-03-20 Alexander Paunov

In this paper, we study positivity phenomena for the $e$-coefficients of Stanley's chromatic function of a graph. We introduce a new combinatorial object: the {\em correct} sequences of unit interval orders, and using these, in certain…

组合数学 · 数学 2017-03-20 Alexander Paunov , András Szenes

We prove necessary conditions for certain elementary symmetric functions, $e_\lambda$, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the generalization considered by Shareshian and Wachs. We do…

组合数学 · 数学 2024-07-09 Bruce E. Sagan , Foster Tom

We give a proof of Stanley-Stembridge conjecture on chromatic symmetric functions for the class of all unit interval graphs with independence number 3. That is, we show that the chromatic symmetric function of the incomparability graph of a…

组合数学 · 数学 2022-04-27 Soojin Cho , Jaehyun Hong

The Stanley-Stembridge conjecture asserts that the chromatic symmetric function of a $(3+1)$-free graph is $e$-positive. Recently, Hikita proved this conjecture by giving an explicit $e$-expansion of the Shareshian-Wachs $q$-chromatic…

组合数学 · 数学 2025-04-10 Sean T. Griffin , Anton Mellit , Marino Romero , Kevin Weigl , Joshua Jeishing Wen

In 1995 Stanley conjectured that the chromatic symmetric functions of the graphs $P_{d,2}$, which we call triangular ladders, were $e$-positive. In this paper we confirm this conjecture, which is also an unsolved case of the celebrated…

组合数学 · 数学 2019-07-02 Samantha Dahlberg

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…

组合数学 · 数学 2016-08-31 Soojin Cho , Stephanie van Willigenburg

We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…

组合数学 · 数学 2018-03-26 James Haglund , Andrew Timothy Wilson

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

组合数学 · 数学 2007-06-20 Louis J. Billera , Hugh Thomas , Stephanie van Willigenburg

This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential…

经典分析与常微分方程 · 数学 2009-07-14 Aleksandar Ignjatovic