arXiv research

Improved BER with reduced power in time-domain digital backpropagation.

The paper reveals a property of chromatic homology for complete graphs.

We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and their associated combinatorial and topological quantities. In particular, we def…

In this paper we give a new characterization of the h-vector of the chromatic polynomial of a graph. We introduce reduced chromatic cohomology of a graph and show that h_i are its Betti numbers. We then discuss various combinatorial properties of these cohomologies. In particular we prove that these cohomologies depend…

This article is about chromatic numbers of hyperbolic surfaces. For a metric space, the $d$-chromatic number is the minimum number of colors needed to color the points of the space so that any two points at distance $d$ are of a different color. We prove upper bounds on the $d$-chromatic number of any hyperbolic surfac…

This paper introduces a conceptual framework, in the context of quantum topology and the algebras underlying it, for analyzing relations obeyed by the chromatic polynomial χ(Q) of planar graphs. Using it we give new proofs and substantially extend a number of classical results concerning the combinatorics of the chroma…

The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to …

Paper studies special braids from chromatic configuration spaces.

Higher chromatic numbers $χ_s$ of simplicial complexes naturally generalize the chromatic number $χ_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $χ_s$ of $d$-complexes can become arbitrarily large for $s\leq\lceil d/2\rceil$ [6,18]. In contrast, $χ_{d+1}=1$, and only little is known on $χ_s$ for …

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane graphs, we show that our chromatic homology can be recovered from the Khovanov h…

The paper defines new TQFTs from non-semisimple categories and proves spherical categories are chromatic.

The chromatic number of sphere graphs in 3-manifolds is bounded.

Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve the bounds for the homological span of chromatic homology by Helme-Guizon, Przy…

Topology helps estimate chromatic numbers of random graphs on spheres.

Developed a new homology theory for graph chromatic polynomials.

In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. Helme-Guizon and Y. Rong. Namely, for a connected graph G with n vertices the only non-trivial cohomology groups $H^{i,n-i}(G)$, $H^{i,n-i-1}(G)$ come in isomorphic pairs: $H^{i,n-i}(G)\cong H…

In the first few homological gradings, there is an isomorphism between the Khovanov homology of a link and the categorification of the chromatic polynomial of a graph related to the link. In this article, we show that the categorification of the chromatic polynomial only contains torsion of order two, and hence Khovano…

In this paper we show that the matrix of chromatic joins and the Gram matrix of the Temperley-Lieb algebra are similar (after rescaling), with the change of basis given by diagonal matrices.

This paper defines girth for knots and links, linking it to Khovanov homology.

We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that represent a fixed non-zero homology class is uniquely t-colorable, where t denotes it…

For every orientable surface of finite negative Euler characteristic, we find a right-angled Artin group of cohomological dimension two which does not embed into the associated mapping class group. For a right-angled Artin group on a graph $\gam$ to embed into the mapping class group of a surface $S$, we show that the …

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known deletion-contraction rule. This work is motivated by Khovanov's work on categorification of the…

The relative chromatic number $c\_0(S)$ of a compact surface $S$ with boundary is defined as the supremum of the chromatic numbers of graphs embedded in $S$ with all vertices on $\partial S$. This topological invariant was introduced for the study of the multiplicity of the first Steklov eigenvalue of $S$. In this arti…

Chromatic Learning reduces feature dimensions for sparse datasets.

Defines a new 2+1-G-HQFT using graded skein modules.

We introduce characteristics into chromatic homotopy theory. This parallels the prime characteristics in number theory as well as in our earlier work on structured ring spectra and unoriented bordism theory. Here, the K(n)-local Hopkins-Miller classes $ζ_n$ take the places of the prime numbers, and this allows us to di…

A 2-complex requires at least 12 colours to avoid edge conflicts.

The paper categorifies matroid characteristic polynomials using cohomology.

Defines Hopf monoid of directed graphs and its invariant.

New framework links fractal complexity to separation dimension.

Paper connects two invariants of 3D manifolds using Hopf algebras.

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 where the coefficient ring is a non-commutative algebra. In this paper we define a …

Skewness dispersion predicts future stock market returns, especially in months with monetary policy announcements.

New dispersion indices based on inaccuracy and divergence introduced for information measures.

We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero. The golden identity for the flow polynomial is conjectured to characterize …

New heat dispersion laws established for smooth compact manifolds.

Paper predicts urban dispersal events using deep survival analysis on mobility data.

MallowsPO enhances LLM fine-tuning with a dispersion index of human preferences.

Paper calculates Gromov-Hausdorff distance between simplexes and 2-distance spaces.

Geometric focusing affects dispersive estimates for Schrödinger and wave equations.

Study on stock market volatility and return dispersion during COVID-19.

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to $\mathcal{P}_{g,p}$. We introduce a new invariant of a graph, the 'nested complex…

In the recent years, banks have sold structured products such as worst-of options, Everest and Himalayas, resulting in a short correlation exposure. They have hence become interested in offsetting part of this exposure, namely buying back correlation. Two ways have been proposed for such a strategy : either pure correl…

The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks are included.

The study examines Hawkes processes and their long-term behavior.

New framework controls statistical dispersion for high-stakes applications.

Machine learning improves fiber nonlinearity detection.

Machine learning classifies surface wave dispersion curves from ambient noise.