Related papers: Chromatic Derivatives, Chromatic Expansions and As…
This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that a graph with polynomial expansion have sublinear…
In this paper we consider some new classical effects obtained for a planar electrodynamics with the presence of a higher order derivatives term. The model can be interpreted as a kind of extension for the $3d$ Maxwell-Chern-Simons…
In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…
We review the combinatorial, topological, algebraic and metric properties supported by $(D+1)$-colored graphs, with a focus on those that are pertinent to the study of tensor model theories. We show how to extract a limiting continuum…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on $n$ vertices. Can the extremal graphs be explored? While…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
Convergent expansions are derived for three types of orthogonal polynomials: Charlier, Laguerre and Jacobi. The expansions have asymptotic properties for large values of the degree. The expansions are given in terms of functions that are…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We outline the current status of the differential expansion (DE) of colored knot polynomials i.e. of their $Z$--$F$ decomposition into representation-- and knot--dependent parts. Its existence is a theorem for HOMFLY-PT polynomials in…
The abstract chromatic number was introduced by Razborov and Coregliano in 2020 in using the language of model theory, and was used to extend the Erd\H os-Stone-Simonovits theorem to graphs with extra structures. A purely combinatorial…
We construct a bipartite generalization of Alon and Szegedy's nearly orthogonal vectors, thereby obtaining strong bounds for several extremal problems involving the Lov\'asz theta function, vector chromatic number, minimum semidefinite…
The question of defining unique, generally applicable constrained second, and higher-order, derivatives is investigated. It is shown that second-order constrained derivatives obtained via two successive constrained differentiations provide…
A general precedure is outlined for an algorithmic implementation of the strong coupling expansion of lattice chiral models on arbitrary lattices. A symbolic character expansion in terms of connected values of group integrals on skeleton…
The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…