Related papers: Coloring Random Triangulations

The orbital bivariate chromatic polynomial, introduced in this article, counts the number of ways to color the vertices of a graph with $\lambda$ colors such that adjacent vertices either receive distinct colors from a set of $\lambda$…

We give superexponential lower and upper bounds on the number of coloured $d$-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and $d\geq 3$ is fixed. In the special…

We associate a coloured quiver to a rigid object in a Hom-finite 2-Calabi--Yau triangulated category and to a partial triangulation on a marked (unpunctured) Riemann surface. We show that, in the case where the category is the generalised…

We obtain a symmetric tridiagonal matrix representation of the Dirac-Coulomb operator in a suitable complete square integrable basis. Orthogonal polynomials techniques along with Darboux method are used to obtain the bound states energy…

We prove that if G is a triangulation of the torus and \chi(G) \neq 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.

There are many extremely challenging problems about existence of monochromatic arithmetic progressions in colorings of groups. Many theorems hold only for abelian groups as results on non-abelian groups are often much more difficult to…

Let $G = (V,E)$ be a finite simple graph. Recall that a proper coloring of $G$ is a mapping $\varphi: V\to\{1,\ldots,k\}$ such that every color class induces an independent set. Such a $\varphi$ is called a semi-matching coloring if the…

We consider the double-scaling limit in matrix models for two-dimensional quantum gravity, and establish the nonperturbative functional Renormalization Group as a novel technique to compute the corresponding interacting fixed point of the…

A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…

Given a graph $G$ and color set $\{1, \ldots, k\}$, a $\textit{proper coloring}$ is an assignment of a color to each vertex of $G$ such that no two vertices connected by an edge are given the same color. The problem of drawing a proper…

This paper discusses reformulations of the problem of coloring plane maps with four colors. The context is the edge-coloring with three colors of cubic graphs such that three distinct colors occur at each vertex. We include discussion of…

It is shown that the square-triangle random tiling model is equivalent to an asymmetric limit of the three colouring model on the honeycomb lattice. The latter model is known to be the O(n) model at T=0 and corresponds to the integrable…

We survey some principal results and open problems related to colorings of geometric and algebraic objects endowed with symmetries, concentrating the exposition on the maximal symmetry numbers of such objects.

We show that if a coloring of the plane has the properties that any two points at distance one are colored differently and the plane is partitioned into uniformly colored triangles under certain conditions, then it requires at least seven…

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…

Using a recently developed approach for solving the three dimensional Dirac equation with spherical symmetry, we obtain simple representations for the Green's function of the Dirac-Oscillator and Dirac-Coulomb problems. This is accomplished…

In this work, based on consideration of periodicity and asymptotic forms of wave function, we propose a novel approach to the solution of finite volume three-body problem by mapping a three-body problem into a higher dimensional two-body…

NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…

Image colorization is a challenging problem due to multi-modal uncertainty and high ill-posedness. Directly training a deep neural network usually leads to incorrect semantic colors and low color richness. While transformer-based methods…