Related papers: The Chromatic Quasisymmetric Class Function of a D…
The pseudo-Gamma function is a key tool introduced recently by Cheng and Albeverio in the proof of \break the density hypothesis. This function is doubly symmetric, which means that it is reflectively symmetric about the real axis by the…
We prove necessary conditions for certain elementary symmetric functions, $e_\lambda$, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the generalization considered by Shareshian and Wachs. We do…
We investigate the class of bisymmetric and quasitrivial binary operations on a given set $X$ and provide various characterizations of this class as well as the subclass of bisymmetric, quasitrivial, and order-preserving binary operations.…
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph $G$ is either $\Delta(G)+1$ or $\Delta(G)+2$, where $\Delta(G)$ is the largest degree of any vertex…
The aim of this note is to compare work of Formanek \cite{formanek2} on a certain construction of central polynomials with that of Collins \cite{Coll} on integration on unitary groups. These two quite disjoint topics share the construction…
Inspired by the Ax--Kochen isomorphism theorem, we develop a notion of categorical ultraproducts to capture the generic behavior of an infinite collection of mathematical objects. We employ this theory to give an asymptotic solution to the…
J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case…
A semiclassical diagrammatic approach is constructed for calculating correlation functions of observables in open chaotic systems with time reversal symmetry. The results are expressed in terms of classical correlation functions involving…
DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was…
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,…
We investigate analogs of symmetric functions arising from an extension of the nilHecke algebra defined by Naisse and Vaz. These extended symmetric functions form a subalgebra of the polynomial ring tensored with an exterior algebra. We…
We define dual equivalence for any collection of combinatorial objects endowed with a descent set, and we show that giving a dual equivalence establishes the symmetry and Schur positivity of the quasi-symmetric generating function. We give…
We study the poles of the twisted adjoint L function of a generic cuspidal automorphic representation of GL(3) or a quasisplit unitary group using a method pioneered by Ginzburg and Jiang and based on the theory of integral representations.
We give a proof of Stanley-Stembridge conjecture on chromatic symmetric functions for the class of all unit interval graphs with independence number 3. That is, we show that the chromatic symmetric function of the incomparability graph of a…
We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs.…
In 1995 Stanley introduced a generalization of the chromatic polynomial of a graph $G$, called the chromatic symmetric function, $X_G$, which was generalized to noncommuting variables, $Y_G$, by Gebhard-Sagan in 2001. Recently there has…
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…
Generalizations of classical theta functions are proposed that include any even number of analytic parameters for which conditions of quasi-periodicity are fulfilled and that are representations of extended Heisenberg group. Differential…