Related papers: Chromatic maps for finite tensor categories
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
We define a (3+1)-TQFT associated with possibly non-semisimple finite unimodular ribbon tensor categories using skein theory. This gives an explicit realization of a TQFT predicted by the cobordism hypothesis, based on recent results on…
Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological…
In this expository paper we explain in detail how to construct bicategorical colimits of several kinds of tensor categories, for example essentially small finitely cocomplete K-linear tensor categories. The constructions are direct and…
We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…
In this paper, we use a topological quantum field theory (TQFT) to define families of new homology theories of a $2$-dimensional CW complex of a smooth closed surface. The dimensions of these homology groups can be used to count the number…
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1,2) thus resolving a conjecture of Jackson's in the negative. In addition, we briefly consider other graph classes that are conjectured…
We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…
Topological indices are real numbers invariant under graph isomorphisms. Chromatic analogue of topological indices has been introduced recently in literature in 2017. Mainly, chromatic versions of Zagreb indices are studied lately. This…
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.
In this paper, perfect k-orthogonal colourings of tensor graphs are studied. First, the problem of determining if a given graph has a perfect 2-orthogonal colouring is reformulated as a tensor subgraph problem. Then, it is shown that if two…
The study of quantum chromatic numbers of graphs is a hot research topic in recent years. However, the infinite family of graphs with known quantum chromatic numbers are rare, as far as we know, the only known such graphs (except for…
In the first part, we determine conditions on spectra X and Y under which either every map from X to Y is phantom, or no nonzero maps are. We also address the question of whether such all or nothing behaviour is preserved when X is replaced…
This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles in the plane does not.
We study the spectrum of prime ideals in the tensor-triangulated category of compact equivariant spectra over a finite group. We completely describe this spectrum as a set for all finite groups. We also make significant progress in…
Higher chromatic numbers $\chi_s$ of simplicial complexes naturally generalize the chromatic number $\chi_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $\chi_s$ of $d$-complexes can become arbitrarily large for…
In the present paper, we introduce the concept of universal graph series. We then present four invariants of graphs and discuss some of their properties. In particular, one of these invariants is a generalization of the chromatic symmetric…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…