Related papers: Limit shapes for Domain-Wall (colored) vertex mode…
We obtain limit shape of perfect matchings on a large class of rail-yard graphs with right boundary condition given by the empty partition, and left boundary condition given by either by a staircase partition with constant density or a…
We investigate the thermodynamic and critical properties of an interacting domain wall model which is derived from the triangular lattice antiferromagnetic Ising model with the anisotropic nearest and next nearest neighbor interactions. The…
We consider a rational six vertex model on a rectangular lattice with boundary conditions that generalize the usual domain wall type. We find that the partition function of the inhomogeneous version of this model is given by a modified…
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…
A majority coloring of an undirected graph is a vertex coloring in which for each vertex there are at least as many bi-chromatic edges containing that vertex as monochromatic ones. It is known that for every countable graph a majority…
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…
We consider the hermitian random matrix model with external source and general polynomial potential, when the source has two distinct eigenvalues but is otherwise arbitrary. All such models studied so far have a common feature: an…
A $b$-coloring of a graph is a proper vertex coloring such that each color class contains a vertex that sees all other colors in its neighborhood. The $b$-coloring problem, in which the task is to decide whether a graph admits a…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach…
We study the behavior of configurations in the symmetric six-vertex model with $a,b,c$ weights in the $n\times n$ square with Domain Wall Boundary Conditions as $n\to\infty$. We prove that when $\Delta=\frac{a^2+b^2-c^2}{2ab}<1$,…
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults…
We discover a new property of the stochastic colored six-vertex model called flip-invariance. We use it to show that for a given collection of observables of the model, any transformation that preserves the distribution of each individual…
An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gy\'arf\'as and S\'ark\"ozy we prove that (1.) the vertex set of every $r$-edge colored…
We consider $N$ non-intersecting Brownian bridges conditioned to stay below a fixed threshold. We consider a scaling limit where the limit shape is tangential to the threshold. In the large $N$ limit, we determine the limiting distribution…
A vertex colouring is called a \emph{parity vertex colouring} if every path in $G$ contains an odd number of occurrences of some colour. Let $\chi_{p}(G)$ be the minimal number of colours in a parity vertex colouring of $G$. We show that…
We consider the change in the asymptotic behavior of solutions of the type of flat domain walls (i.e., kink solutions) in field-theoretic models with a real scalar field. We show that when the model is deformed by a bounded deforming…
Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary…
In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…