相关论文: Approximating the monomer-dimer constants through …
We study the classical hard-core dimer model on the triangular lattice. Following Kasteleyn's fundamental theorem on planar graphs, this problem is soluble by Pfaffians. This model is particularly interesting for, unlike the dimer problems…
For piecewise-linear maps, the phenomenon that a branch of a one-dimensional unstable manifold of a periodic solution is completely contained in its stable manifold is codimension-two. Unlike codimension-one homoclinic corners, such…
A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{rm, r}=K_{rm,rm}-mK_{r,r}$. We first give a formula to count the number of perfect matchings of…
The exact matching condition is given for hadron matrix elements calculated in any two different schemes, in particular, in the lattice and dimensional regularization, (modified) minimal subtraction $\overline{\rm MS}$ schemes. The result…
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…
We present a Monte Carlo algorithm that provides efficient and unbiased sampling of polymer melts consisting of two chains of equal length that jointly visit all the sites of a cubic lattice with rod geometry L x L x rL and non-periodic…
We present preliminary numerical results from a lattice study of the two-dimensional O(3) non-linear sigma model. In the continuum this model possesses N=2 supersymmetry. The lattice formulation we use retains an exact (twisted)…
In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…
We show that any second order linear ordinary diffrential equation with constant coefficients (including the damped and undumped harmonic oscillator equation) admits an exact discretization, i.e., there exists a difference equation whose…
We propose a model for a two dimensional, associative water-like lattice gas with one single variable representing both long and short-range interactions. The corresponding hamiltonian was solved exactly, by state enumeration in a finite…
We discuss in details a modified variational matrix-product-state algorithm for periodic boundary conditions, based on a recent work by P. Pippan, S.R. White and H.G. Everts, Phys. Rev. B 81, 081103(R) (2010), which enables one to study…
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…
For a given statistical model, the bipartite fidelity $\mathcal F$ is computed from the overlap between the groundstate of a system of size $N$ and the tensor product of the groundstates of the same model defined on two subsystems $A$ and…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
A lattice model is presented for the simulation of dynamics in polymeric systems. Each polymer is represented as a chain of monomers, residing on a sequence of nearest-neighbor sites of a face-centered-cubic lattice. The polymers are self-…
We construct stable periodic solutions for a simple form nonlinear delay differential equation (DDE) with a periodic coefficient. The equation involves one underlying nonlinearity with the multiplicative periodic coefficient. The well-known…
This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials…
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…
We present a semiclassical trace formula for the canonical partition function of arbitrary one-dimensional systems. The approximation is obtained via the stationary exponent method applied to the phase-space integration of the density…
We characterize the entire functions $P$ of $d$ variables, $d\ge 2,$ for which the $\mzd$-translates of $P\chi_{[0,N]^d}$ satisfy the partition of unity for some $N\in \mn.$ In contrast to the one-dimensional case, these entire functions…