Related papers: Chromatic functions, interval orders and increasin…
Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict…
Chromatic derivatives and series expansions of bandlimited functions have recently been introduced in signal processing and they have been shown to be useful in practical applications. We extend the notion of chromatic derivative using…
R.P. Stanley defined a invariant for graphs called the chromatic symmetric function and conjectured it is complete invariant for trees. Miezaki et al. generalised the chromatic symmetric function and defined the Kneser chromatic functions…
Quasi-symmetric functions show up in an approach to solve the Kadomtsev-Petviashvili (KP) hierarchy. This moreover features a new nonassociative product of quasi-symmetric functions that satisfies simple relations with the ordinary product…
For a class of symplectic manifolds, we introduce a functional which assigns a real number to any pair of continuous functions on the manifold. This functional has a number of interesting properties. On the one hand, it is Lipschitz with…
We consider a class of iterated function systems (IFSs) of contracting similarities of $R^n$, introduced by Hutchinson, for which the invariant set possesses a natural H\"older continuous parameterization by the unit interval. When such an…
We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $\Gamma\wr\SG_n$ and…
The main result of this paper is the introduction of marked graphs and the marked graph polynomials ($M$-polynomial) associated with them. These polynomials can be defined via a deletion-contraction operation. These polynomials are a…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…
A classical limit theorem of stochastic process theory concerns the sample cumulative distribution function (CDF) from independent random variables. If the variables are uniformly distributed then these centered CDFs converge in a suitable…
We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep connection with algebraic topology. We present a novel…
The ring of symmetric functions occupies a central place in algebraic combinatorics, with a particularly notable role in Schubert calculus, where the standard cell decompositions of Grassmannians yield the celebrated family of Schur…
In this paper, we study the class ${\Sigma^{(m)}(p)}$ of meromorphic univalent functions $f$ in $\mathbb{D}$ with a pole of order ${m \geq 1}$ at $p \in (0,1)$, admitting a $k$-quasiconformal extension ($0 \leq k < 1$) to…
In 2015, Brosnan and Chow, and independently Guay-Paquet, proved the Shareshian-Wachs conjecture, which links the Stanley-Stembridge conjecture in combinatorics to the geometry of Hessenberg varieties through Tymoczko's permutation group…
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…
The chromatic symmetric $X_G$ function is a symmetric function generalization of the chromatic polynomial of a graph, introduced by Stanley (1995). Stanley gave an expansion formula for $X_G$ in terms of the power sum symmetric functions…
This paper has two main parts. First, we consider the Tutte symmetric function $XB$, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of $XB$ and show that this function admits a…
In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, the functions…