Related papers: Coloring Random Triangulations
Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…
The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-colorability problem iteratively, decreasing k one by one.…
In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…
We show how graph neural networks can be used to solve the canonical graph coloring problem. We frame graph coloring as a multi-class node classification problem and utilize an unsupervised training strategy based on the statistical physics…
We consider solutions to the $4$-color problem for the vertices of sphere triangulations with degree sequence $6,...,6,4,4,4,4,4,4$. We sort these solutions into combinatorial types and show that each generic type $\tau$ is parametrized by…
We study the problem of bicoloring random hypergraphs, both numerically and analytically. We apply the zero-temperature cavity method to find analytical results for the phase transitions (dynamic and static) in the 1RSB approximation. These…
We construct a generalisation of the three-dimensional Poincar\'e algebra that also includes a colour symmetry factor. This algebra can be used to define coloured Poincar\'e gravity in three space-time dimensions as well as to study…
In the $\ell$-Coloring Problem, we are given a graph on $n$ nodes, and tasked with determining if its vertices can be properly colored using $\ell$ colors. In this paper we study below-guarantee graph coloring, which tests whether an…
Given a large social or information network, how can we partition the vertices into sets (i.e., colors) such that no two vertices linked by an edge are in the same set while minimizing the number of sets used. Despite the obvious practical…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials…
A 2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such that no edge is monochromatic. Let $H_k(n,m)$ be a random $k$-uniform hypergraph on $n$ vertices formed by picking $m$ edges uniformly, independently…
Rectangular $N\times M$ matrix models can be solved in several qualitatively distinct large $N$ limits, since two independent parameters govern the size of the matrix. Regarded as models of random surfaces, these matrix models interpolate…
In the usual matrix-model approach to random discretized two-dimensional manifolds, one introduces n Ising spins on each cell, i.e. a discrete version of 2D quantum gravity coupled to matter with a central charge n/2. The matrix-model…
All solutions of the set-theoretic constant tetrahedron equation with two colors are found, and some of their properties are analyzed. The list includes 406 solutions - we call them R-operators, - most of which are degenerate…
Convolutions for Tribonacci numbers involving binomial coefficients are treated with ordinary generating functions and the diagonalization method of Hautus and Klarner. In this way, the relevant generating function can be established, which…
We proposed, in our previous paper, to characterize the Hirota-Miwa equation by means of the theory of triangulated category. We extend our argument in this paper to support the idea. In particular we show in detail how the singularity…
The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic numbers, they tend to take an enormous amount of time for…
It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on $t$ vertices, for fixed $t$. We propose an algorithm that, given a 3-colorable graph without…