Search arXivSearch

arXiv · 2410.04669

A lift of chromatic symmetric functions to $\textsf{NSym}$

Abstract

If we consider previously introduced extensions of Stanley's chromatic symmetric function $X_{G}(x_1, x_2, \ldots)$ for a graph $G$ to elements in the algebra $\textsf{QSym}$ of quasisymmetric functions and in the algebra $\textsf{NCSym}$ of symmetric functions in noncommuting variables, this motivates our introduction of a lifting of $X_{G}$ to the dual of $\textsf{QSym}$, i.e., the algebra $\textsf{NSym}$ of noncommutative symmetric functions, as opposed to $\textsf{NCSym}$. For an unlabelled directed graph $D$, our extension of chromatic symmetric functions provides an element $\text{X}_{D}$ in $\textsf{NSym}$, in contrast to the analogue $Y_{G} \in \textsf{NCSym}$ of $X_{G}$ due to Gebhard and Sagan. Letting $G$ denote the undirected graph underlying $D$, our construction is such that the commutative image of $\text{X}_{D}$ is $ X_{G}$. This projection property is achieved by lifting Stanley's power sum expansion for chromatic symmetric functions, with the use of the $Ψ$-basis of $\textsf{NSym}$, so that the orderings of the entries of the indexing compositions are determined by the directed edges of $D$. We then construct generating sets for $\textsf{NSym}$ consisting of expressions of the form $\text{X}_{D}$, building on the work of Cho and van Willigenburg on chromatic generating sets for $\textsf{Sym}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2024-10-07. A lift of chromatic symmetric functions to $\textsf{NSym}$. https://arxiv.org/abs/2410.04669

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO