Related papers: Triangular Ladders $P_{d,2}$ are $e$-positive

In 2020, Dahlberg, She, and van Willigenburg conjectured that the chromatic symmetric function of any tree with maximum degree at least 4 is not e-positive. Zheng and Tom verified this conjecture for all trees with maximum degree at least 5…

Consider a graph obtained by taking edge disjoint union of $k$ complete bipartite graphs. Alon, Saks and Seymour conjectured that such graph has chromatic number at most $k+1$. This well known conjecture remained open for almost twenty…

For a natural unit interval order $P$, we describe proper colorings of the incomparability graph of $P$ in the language of heaps. We also introduce a combinatorial operation, called a \emph{local flip}, on the heaps. This operation defines…

We develop a composition method to unearth positive $e_I$-expansions of chromatic symmetric functions $X_G$, where the subscript $I$ stands for compositions rather than integer partitions. Using this method, we derive positive and neat…

Let $\mathbb{N}$ denote the set of non-negative integers. Haglund, Wilson, and the second author have conjectured that the coefficient of any Schur function $s_\lambda[X]$ in $\Delta_{e_k} e_n[X]$ is a polynomial in $\mathbb{N}[q,t]$. We…

Shareshian-Wachs, Brosnan-Chow, and Guay-Pacquet [Adv. Math. ${\bf 295}$ (2016), ${\bf 329}$ (2018), arXiv:1601.05498] realized the chromatic (quasi-)symmetric function of a unit interval graph in terms of Hessenberg varieties. Here we…

A recent conjecture by C. Carlet on the sum-freedom of the binary multiplicative inverse function can be stated as follows: For each pair of positive integers $(n,k)$ with $3\le k\le n-3$, there is a $k$-dimensional $\Bbb F_2$-subspace $E$…

The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…

We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum…

We introduce a new method to construct uncountably chromatic graphs from non special trees and ladder systems. Answering a question of P. Erd\H{o}s and A. Hajnal from 1985, we construct graphs of chromatic number $\omega_1$ without…

We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials. We show that there are parallel…

The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the planar graph is even-triangulated or all cycles are greater…

Let R_n be the ring of coinvariants for the diagonal action of the symmetric group S_n. It is known that the character of R_n as a doubly-graded S_n module can be expressed using the Frobenius characteristic map as \nabla e_n, where e_n is…

The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generalizes the notion of the chromatic number of graphs, it has been…

The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…

In a study, published in Nature, researchers from DeepMind and mathematicians demonstrated a general framework using machine learning to make conjectures in pure mathematics. Here, we build upon this framework to develop a method for…

A connected graph $G$ with chromatic number $t$ is double-critical if $G \backslash \{x, y\}$ is $(t - 2)$-colorable for each edge $xy \in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing…

As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, ...,e_{2k}, J\})$ where $e_i$'s are standard basis and $J$ is…

We prove twist positivity and positivity of the pair correlation function for combined spatial and internal symmetries of free bosonic Lagrangians. We work in a general setting, extending the results obtained in Twist Positivity [1].

We study the space, $R_m$, of $m$-symmetric functions consisting of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},x_{m+3},\dots$ but have no special symmetry in the variables $x_1,\dots,x_m$. We obtain $m$-symmetric…