Related papers: Chromatic maps for finite tensor categories

In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our…

We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if $H$ is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single…

We construct 3-dimensional once-Extended Topological Quantum Field Theories (ETQFTs for short) out of (possibly non-semisimple) modular categories, and we explicitly identify linear categories and functors in their image. The circle…

The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If for each vertex its incident edges have different color,…

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and…

The determination of the quantum chromatic number of graphs has attracted considerable attention recently. However, there are few families of graphs whose quantum chromatic numbers are determined. A notable exception is the family of…

We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.

We demonstrate the existence of quasiconformal mappings on closed manifolds that cannot be decomposed as a composition of mappings with arbitrarily small conformal distortion.

This user's guide (updated version) consists of two parts. The first part is an extensive survey contributed to the Encyclopedia of Mathematical Physics, 2nd edition. It covers many of the main constructions, definitions, and applications…

In recent work with Harman, we introduced a new notion of measure for oligomorphic groups, and showed how they can be used to produce interesting tensor categories. Determining the measures for an oligomorphic group is (in our view) an…

Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any…

Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In…

We prove that up to two exceptions, every connected subcubic triangle-free graph has fractional chromatic number at most 11/4. This is tight unless further exceptional graphs are excluded, and improves the known bound on the fractional…

We introduce a representation via (n+1)-colored graphs of compact n-manifolds with (possibly empty) boundary, which appears to be very convenient for computer aided study and tabulation. Our construction is ageneralization to arbitrary…

We use a 2-categorical version of (de-)equivariantization to classify (3+1)d topological orders with a finite $G$-symmetry. In particular, we argue that (3+1)d fermionic topological order with $G$-symmetry correspond to…

In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $\chi(G(n,r,s))$ in large part of cases.

This paper concerns a study of three families of non-compact type symmetric spaces of infinite dimension. Although they have infinite dimension they have finite rank. More precisely, we show they have finite telescopic dimension. We also…

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown…

In earlier work, we had shown that Cannon-Thurston maps exist for Kleinian surface groups. In this paper we prove that pre-images of points are precisely end-points of leaves of the ending lamination whenever the Cannon-Thurston map is not…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…