Related papers: A new solution for the two dimensional dimer probl…
In this exposition, we consider the dimer problem on an infinite square lattice with partially non-periodic edge weights, which we refer to as the square lattice with interface. In particular, we compute an exact integral form of the…
The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…
We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices…
We discuss some aspects of a new noncombinatorial fermionic approach to the two-dimensional dimer problem in statistical mechanics based on the integration over anticommuting Grassmann variables and factorization ideas for dimer density…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…
We use computational method to investigate the number of ways to pack dimers on \emph{odd-by-odd} lattices. In this case, there is always a single vacancy in the lattices. We show that the dimer configuration numbers on $(2k+1) \times…
On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…
The 1970s conjecture of Lov\'asz and Plummer that the number of perfect matchings in any $3$-regular graph is exponential in the number of vertices was proved in 2011 by Esperet, Kardo\v{s}, King, Kr\'al', and Norine. We give the exact…
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related…
We consider the dimer-monomer problem for the rectangular lattice. By mapping the problem into one of close-packed dimers on an extended lattice, we rederive the Tzeng-Wu solution for a single monomer on the boundary by evaluating a…
In this paper we study the Dirichlet problem for fully nonlinear second-order equations on a riemannian manifold. As in a previous paper we define equations via closed subsets of the 2-jet bundle. Basic existence and uniqueness theorems are…
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
We consider the Cauchy problem for a second-order nonlinear evolution equation in a Hilbert space. This equation represents the abstract generalization of the Ball integro-differential equation. The general nonlinear case with respect to…
We solve the monomer-dimer problem on a non-bipartite lattice, the simple quartic lattice with cylindrical boundary conditions, with a single monomer residing on the boundary. Due to the non-bipartite nature of the lattice, the well-known…
In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…
For any $\gamma>0$, Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$-vertex $k$-uniform hypergraph whose minimum codegree is at least $n/k+\gamma n$. We prove a…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…