Related papers: Dimer piling problems and interacting field theory
We review one dimensional matrix theory and its variations, collective field theory and quantum phase space description. In the planar limit, these theories become classical and can be easily analyzed. With these descriptions, one…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
The classical 1961 solution to the problem of determining the number of perfect matchings (or dimer coverings) of a rectangular grid graph -- due independently to Kasteleyn and to Temperley and Fisher -- consists of changing the sign of…
A tiling is a cover of R^d by tiles such as polygons that overlap only on their borders. A patch is a configuration consisting of finitely many tiles that appears in tilings. From a tiling, we can construct a dynamical system which encodes…
This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple graph $G$ requires either $\Delta$ or $\Delta+1$ colors,…
Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…
We provide a simple algorithm for constructing Hamiltonian graph cycles (visiting every vertex exactly once) on a set of arbitrarily large finite subgraphs of aperiodic two-dimensional Ammann-Beenker (AB) tilings. Using this result, and the…
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some…
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum…
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of…
A graph G is prismatic if for every triangle T of G, every vertex of G not in T has a unique neighbour in T. The complement of a prismatic graph is called \emph{antiprismatic}. The complexity of colouring antiprismatic graphs is still…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
This paper studies the dimer model on the dual graph of the square-octagon lattice, which can be viewed as the domino tilings with impurities in some sense. In particular, under a certain boundary condition, we give an exact formula…
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…
The deductive method ruled mathematics for the last 2500 years, now it is the turn of the inductive method. Here we make a modest start by using the inductive method to discover and prove (rigorously) explicit generating functions for the…