Related papers: $e$-positivity of vertical strip LLT polynomials

For any given graph G = (V,E) we define in a certain way a new graph G(x,y,z) with the vertex set V\cup E depending on parameters x,y,z from {0,1, +, -} and call graph G(x,y,z) the (x,y,z)-transformation of G. It turns out that if G is an…

Let $G$ be a simple graph. A pendant path of $G$ is a path such that one of its end vertices has degree $1$, the other end has degree $\ge3$, and all the internal vertices have degree $2$. Let $p_k(G)$ be the number of pendant paths of…

Lattice paths called $\ell$-Schr\"oder paths are introduced. They are paths on the upper half-plane consisting of $\ell+2$ types of steps: $(i,\ell-i)$ for $i=0,\ldots,\ell$, and $(1,-1)$. Those paths generalize Schr\"oder paths and some…

Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…

We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using separately two polynomial identities of Kusraeva involving the root mean power…

Stanley has studied a symmetric function generalization X_G of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of X_G in terms of elementary symmetric functions…

Consider a weighted directed acyclic graph $G$ having an upward planar drawing. We give a formula for the total weight of the families of non-intersecting paths on $G$ with any given starting and ending points. While the…

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…

This paper proves an identity between flagged Schur polynomials, giving a duality between row flags and column flags. This identity generalises both the binomial determinant duality theorem due to Gessel and Viennot and the symmetric…

Given a rational $a=p/q$ and $N$ nonnegative $d$-dimensional real vectors $u_1$, ..., $u_N$, we show that it is always possible to choose $(d-1)+\lceil (pN-d+1)/q\rceil$ of them such that their sum is (componentwise) at least…

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

For a polynomial $P$ of degree greater than one, we show the existence of patterns of the form $(x,x+t,x+P(t))$ with a gap estimate on $t$ in positive density subsets of the reals. This is an extension of an earlier result of Bourgain. Our…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

We introduce the notion of G-hypergeometric function, where G is a complex Lie group. In the case when G is a complex torus, this notion amounts to the notion of Gelfand's A-hypergeometric function. We show that the integral $\int…

This paper presents a fairly general version of the well-known Gleason-Kahane-$\dot{\text{Z}}$elazko (GKZ) theorem in the spirit of a GKZ type theorem obtained recently by Mashreghi and Ransford for Hardy spaces. In effect, we characterize…

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

This paper focuses on the problem of finding a continuous extension of the hypercomplex logarithm along a path. While a branch of the complex logarithm can be defined in a small open neighbourhood of a strictly negative real point, no…

Given a directed graph $E$ and an associative unital ring $R$ one may define the Leavitt path algebra with coefficients in $R$, denoted by $L_R(E)$. For an arbitrary group $G$, $L_R(E)$ can be viewed as a $G$-graded ring. In this article,…

A theorem of Gerald Schwarz [24, Thm. 1] says that for a linear action of a compact Lie group $G$ on a finite dimensional real vector space $V$ any smooth $G$-invariant function on $V$ can be written as a composite with the Hilbert map. We…