Related papers: A symmetric function approach to log-concavity of …

For some positive integer $m$, a real polynomial $P(x)=\sum\limits_{k=0}^ma_kx^k$ with $a_k\geqslant 0$ is called log-concave (resp. ultra log-concave) if $a_k^2\geqslant a_{k-1}a_{k+1}$ (resp. $a_k^2\geqslant…

We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

The tree-independence number tree-$\alpha$, first defined and studied by Dallard, Milani\v{c} and \v{S}torgel, is a variant of treewidth tailored to solving the maximum independent set problem. Over a series of papers, Abrishami et al.…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investigate here purely imaginary independence roots. We show that…

The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…

We show the equivalence of the Pieri formula for flag manifolds and certain identities among the structure constants, giving new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function…

A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$…

In a series of recent talks Richard Stanley introduced a symmetric function associated to digraphs called the Redei-Berge symmetric function. This symmetric function enumerates descent sets of permutations corresponding to digraphs. We show…

We construct a family of trees with independence numbers going to infinity for which the log-concavity relation for the independent set sequence of a tree $T$ in the family fails at around $\alpha(T)\left(1-1/(16\log \alpha(T))\right)$.…

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…

Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…

Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in…

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

An independent set of size $k$ in a finite undirected graph $G$ is a set of $k$ vertices of the graph, no two of which are connected by an edge. Let $x_{k}(G)$ be the number of independent sets of size $k$ in the graph $G$ and let…

We leverage an algorithm of Deming [R.W. Deming, Independence numbers of graphs -- an extension of the Koenig-Egervary theorem, Discrete Math., 27(1979), no. 1, 23--33; MR534950] to decompose a matchable graph into subgraphs with a precise…

We compute an explicit $e$-positive formula for the chromatic symmetric function of a lollipop graph, $L_{m,n}$. From here we deduce that there exist countably infinite distinct $e$-positive, and hence Schur-positive, bases of the algebra…