Related papers: Tiles and colors
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
We consider a tiling model of the two-dimensional square-lattice, where each site is tiled with one of the sixteen Wang tiles. The ground states of this model are all quasi-periodic. The systems undergoes a disorder to quasi-periodicity…
In this paper we propose a simple method for building exactly solvable multi-parameter spectral equations which in turn can be used for constructing completely integrable and exactly solvable quantum systems. The method is based on the use…
A tessellation or tiling is a collection of sets, called tiles, that cover a plane without gaps and overlaps. The present note is an invitation to get to know the beauty and majesty of tessellations and triangulation of orientable surfaces.
We study Yang-Baxter deformations of the flat space string that result in exactly solvable models, finding the Nappi-Witten model and its higher dimensional generalizations. We then consider the spectra of these models obtained by canonical…
A unified approach is applied in the consideration of the multi-parametric (colored) Yang-Baxter equations (YBE) and the usual YBE with two-parametric R-matrices, relying on the existence of the arbitrary functions in the general solutions.…
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
In this work, we present a proof of the existence of real and ordered solutions to the generalized Bethe Ansatz equations for the one dimensional Hubbard model on a finite lattice, with periodic boundary conditions. The existence of a…
We study a model of colored multiwebs, which generalizes the dimer model to allow each vertex to be adjacent to \(n_v\) edges. These objects can be formulated as a random tiling of a graph with partial dimer covers. We examine the case of a…
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…
A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up 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…
Given an edge-coloring of a graph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. We define the palette index of a graph as the minimum number of distinct palettes, taken over all…
Many physical systems like supersymmetric Yang-Mills theories are formulated as quantum matrix models. We discuss how to apply the Beth ansatz to exactly solve some supersymmetric quantum matrix models in the large-N limit. Toy models are…
This work is dedicated to $\mathfrak{sl}_{n+1}$-related integrable stochastic vertex models; we call such models coloured. We prove several results about these models, which include the following: (1) We construct the basis of (rational)…
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static…
There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…
A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…
Exact analyses are given for two three-dimensional lattice systems: A system of close-packed dimers placed in layers of honeycomb lattices and a layered triangular-lattice interacting domain wall model, both with nontrivial interlayer…
This paper deals with the complexity of some natural graph problems when parametrized by {measures that are restrictions of} clique-width, such as modular-width and neighborhood diversity. The main contribution of this paper is to introduce…