Related papers: $\alpha$-chromatic symmetric functions

We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

Given a graph $G$ of order $n$, the $\sigma$-$polynomial$ of $G$ is the generating function $\sigma(G,x) = \sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such…

The absolute value of the coefficient of $q$ in the chromatic polynomial of a graph $G$ is known as the chromatic discriminant of $G$ and is denoted $\alpha(G)$. There is a well known recurrence formula for $\alpha(G)$ that comes from the…

On the set of permutations of a finite set, we construct a bijection which maps the 3-vector of statistics $(maj-exc,des,exc)$ to a 3-vector $(maj\_2,\widetilde{des\_2},inv\_2)$ associated with the $q$-Eulerian polynomials introduced by…

In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…

Let $\CRF_S$ denote the category of $S$-colored rooted forests, and $\H_{\CRF_S}$ denote its Ringel-Hall algebra as introduced in \cite{KS}. We construct a homomorphism from a $K^+_0 (\CRF_S)$--graded version of the Hopf algebra of…

Building up on our previous works regarding $q$-deformed $P$-partitions, we introduce a new family of subalgebras for the ring of quasisymmetric functions. Each of these subalgebras admits as a basis a $q$-analogue to Gessel's fundamental…

We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm…

Bachmann, Takeyama and Tasaka introduced a $\mathbb{Q}$-linear map $\phi$, which we call the symmetrization map in this paper, on the harmonic algebra $\mathfrak{H}^1$. They calculated $\phi(w)$ explicitly for an element $w$ in…

We study semifinite harmonic functions on the zigzag graph, which corresponds to Pieri's rule for the fundamental quasisymmetric functions $\{F_{\lambda}\}$. The main problem, which we solve here, is to classify the indecomposable…

The polynomial relationship between elementary symmetric functions (Cauchy enumeration formula) is formulated via a ``raising operator" and Fock space construction. A simple graphical proof of this relation is proposed. The new operator…

We define the chromatic measure of a finite simple graph as the uniform distribution on its chromatic roots. We show that for a Benjamini-Schramm convergent sequence of finite graphs, the chromatic measures converge in holomorphic moments.…

We define a new basis of the algebra of quasi-symmetric functions by lifting the cycle-index polynomials of symmetric groups to noncommutative polynomials with coefficients in the algebra of free quasi-symmetric functions, and then…

We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…

We study two weighted graph coloring problems, in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given color. We…

J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…

We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.

Inspired by the Ax--Kochen isomorphism theorem, we develop a notion of categorical ultraproducts to capture the generic behavior of an infinite collection of mathematical objects. We employ this theory to give an asymptotic solution to the…

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…