Related papers: Limit shapes for Domain-Wall (colored) vertex mode…

We present numerical results for the six-vertex model with a variety of boundary conditions. Adapting an algorithm proposed by Allison and Reshetikhin for domain wall boundary conditions, we examine some modifications of these boundary…

We study a graph coloring problem that is otherwise easy but becomes quite non-trivial in the one-pass streaming model. In contrast to previous graph coloring problems in streaming that try to find an assignment of colors to vertices, our…

Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices. In the…

We prove the existence of a limit shape for the dimer model on planar periodic bipartite graphs with an arbitrary fundamental domain and arbitrary periodic weights. This proof is based on a variational principle that uses the locality of…

Shearlet systems have so far been only considered as a means to analyze $L^2$-functions defined on $\R^2$, which exhibit curvilinear singularities. However, in applications such as image processing or numerical solvers of partial…

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…

We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…

Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge…

We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once on its vertices. A connected graph $G$ is said to be…

Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…

We study limit shapes for dimer models on domains of the hexagonal lattice with free boundary conditions. This is equivalent to the large deviation phenomenon for a random stepped surface over domains fixed only at part of the boundary.

We consider fermion systems on a square lattice with a mass term having a curved domain-wall. Similarly to the conventional flat domain-wall fermions, massless and chiral edge states appear on the wall. In the cases of $S^1$ and $S^2$…

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

In random tiling and dimer models we can get various limit shapes which gives the boundaries between different types of phases. The shape fluctuations at these boundaries give rise to universal limit laws, in particular the Airy process. We…

We address the question of the dependence of the bulk free energy on boundary conditions for the six vertex model. Here we compare the bulk free energy for periodic and domain wall boundary conditions. Using a determinant representation for…

We observe that the partition function of the six vertex model on a finite square lattice with domain wall boundary conditions is (a restriction of) a KP tau function and express it as an expectation value of charged free fermions (up to an…

We consider the colored asymmetric simple exclusion process (ASEP) and stochastic six vertex (S6V) model with fully packed initial conditions; the states of these models can be encoded by 2-parameter height functions. We show under…

We consider the three-dimensional incompressible Navier--Stokes equations in a curved thin domain with Navier's slip boundary conditions. The curved thin domain is defined as a region between two closed surfaces which are very close to each…

In the first part of this paper, we consider weighted domination in the case where the vertices of the complete graph on~\(n\) vertices are equipped with independent and identically distributed (i.i.d.) weights. We use the probabilistic…

Coloring the vertices of a graph G subject to given conditions can be considered as a random experiment and corresponding to this experiment, a discrete random variable X can be defined as the colour of a vertex chosen at random, with…