Related papers: Coloring Random Triangulations
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 present a new vectorial total variation method that addresses the problem of color consistent image filtering. Our approach is inspired from the double-opponent cell representation in the human visual cortex. Existing methods of…
Given a simple undirected graph $G=(V,E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each part of the partition such that the chromatic number of the…
Given an ideal triangulation of a connected 3-manifold with non-empty boundary consisting of a disjoint union of tori, a point of the deformation variety is an assignment of complex numbers to the dihedral angles of the tetrahedra subject…
Our basic objects are partitions of finite sets of points into disjoint subsets. We investigate sets of partitions which are closed under taking tensor products, composition and involution, and which contain certain base partitions. These…
The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs $H_1,H_2,\ldots$; the graphs…
Neutral atom arrays have emerged as a versatile candidate for the embedding of hard classical optimization problems. Prior work has focused on mapping problems onto finding the maximum independent set of weighted or unweighted unit disk…
Every partial colouring of a Hamming graph is uniquely related to a partial Latin hyper-rectangle. In this paper we introduce the $\Theta$-stabilized $(a,b)$-colouring game for Hamming graphs, a variant of the $(a,b)$-colouring game so that…
In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a…
We show how matrix problems (bimodule categories) can be used in studying triangulated categories. Then we apply the general technique to the classification of stable homotopy types of polyhedra, find out the "representation types" of such…
A conjecture of Erd\H{o}s, Graham, Montgomery, Rothschild, Spencer and Straus states that, with the exception of equilateral triangles, any two-coloring of the plane will have a monochromatic congruent copy of every three-point…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
In this paper we show how to categorify the $n$-color vertex polynomial, which is based upon one of Roger Penrose's formulas for counting the number of $3$-edge colorings of a planar trivalent graph. Using topological quantum field theory…
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
Tools of the intrinsic analysis on manifolds, helpful in solving the invariant inverse problem of the calculus of variations are being presented comprising a combined approach which consists in the simultaneous imposition of symmetry…
We present an alternative procedure to eliminate irregular contributions in the perturbation expansion of c=0-matrix models representing the sum over triangulations of random surfaces, thereby reproducing the results of Tutte [1] and Brezin…
With the evolution of quantum computing, researchers now-a-days tend to incline to find solutions to NP-complete problems by using quantum algorithms in order to gain asymptotic advantage. In this paper, we solve $k$-coloring problem…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most $b$ and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for…