Related papers: Coloring Random Triangulations
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
In this article, we discuss the numerical solution of diffusion equations on random surfaces within the isogeometric framework. We describe in detail, how diffusion problems on random surfaces can be modelled and how quantities of interest…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
Given a graph $G=(V, E)$ and a list of available colors $L(v)$ for each vertex $v\in V$, where $L(v) \subseteq \{1, 2, \ldots, k\}$, List $k$-Coloring refers to the problem of assigning colors to the vertices of $G$ so that each vertex…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
We introduce a new model of random multigraphs with colored vertices and weighted edges. It is similar to the "inhomogeneous random graph model" of S\"oderberg (2002), extended by Bollob\'as, Janson and Riordan (2007). By means of analytic…
We study "tricolor percolation" on the regular tessellation of R^3 by truncated octahedra, which is the three-dimensional analog of the hexagonal tiling of the plane. We independently assign one of three colors to each cell according to a…
We determine the limiting distribution of the logarithm of the number of satisfying assignments in the random $k$-uniform hypergraph 2-colouring problem in a certain density regime for all $k\ge 3$ . As a direct consequence we obtain that…
We apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar N-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams. These…
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…
In this work, we present a branch-and-price algorithm to solve the weighted version of the List Coloring Problem, based on a vertex cover formulation by stable sets. This problem is interesting for its applications and also for the many…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…
In this paper we look for closed expressions to calculate the number of colourings of prime knots for given linear Alexander quandles. For this purpose the colouring matrices are simplified to a triangular form, when possible. The…
Given a coloration of the vertices of a triangulation of a manifold, we give homological conditions on the chromatic complexes under which it is possible to obtain a rainbow simplex
Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…
In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. Instead we propose to…
Two-dimensional random surfaces are studied numerically by the dynamical triangulation method. In order to generate various kinds of random surfaces, two higher derivative terms are added to the action. The phases of surfaces in the…
We introduce and study local combinatorial conditions on a simplicial complex, implying Gromov hyperbolicity of its universal cover. We apply the theory to Thurston's problem on 5/6*-triangulations of 3-manifolds, providing a new proof and…
The three-dimensional non-relativistic isometry algebras, namely Galilei and Newton-Hooke algebras, are known to admit double central extensions, which allows for non-degenerate bilinear forms hence for action principles through…