Related papers: A new solution for the two dimensional dimer probl…
A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and…
Second order accurate Cartesian grid methods have been well developed for interface problems in the literature. However, it is challenging to develop third or higher order accurate methods for problems with curved interfaces and internal…
The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all…
A low frequency approximation of the discrete Sommerfeld diffraction problems, involving the scattering of a time harmonic lattice wave incident on square lattice by a discrete Dirichlet or a discrete Neumann half-plane, is investigated. It…
In recent work, Li et al.\ (Comm.\ Math.\ Sci., 7:81-107, 2009) developed a diffuse-domain method (DDM) for solving partial differential equations in complex, dynamic geometries with Dirichlet, Neumann, and Robin boundary conditions. The…
Lattice radial quantization was proposed in a recent paper by Brower, Fleming and Neuberger[1] as a nonperturbative method especially suited to numerically solve Euclidean conformal field theories. The lessons learned from the lattice…
We collect a number of striking recent results in a study of dimers on infinite regular bipartite lattices and also on regular bipartite graphs. We clearly separate rigorously proven results from conjectures. A primary goal is to show…
The duality theorem of Lass relates the matching polynomials of a simple graph $G$ with the matching polynomials of its complement $\bar G$. In particular, this relation gives rise to Godsil's result, which offers a nice interpretation of…
Finite volume methods for problems involving second order operators with full diffusion matrix can be used thanks to the definition of a discrete gradient for piecewise constant functions on unstructured meshes satisfying an orthogonality…
The paper contains two main parts: in the first part, we analyze the general case of $p\geq 2$ matrices coupled in a chain subject to Cauchy interaction. Similarly to the Itzykson-Zuber interaction model, the eigenvalues of the Cauchy chain…
The "flexible boundary condition" method, introduced by Sinclair and coworkers in the 1970s, remains among the most popular methods for simulating isolated two-dimensional crystalline defects, embedded in an effectively infinite atomistic…
An $r$-graph is an $r$-regular graph with no odd cut of size less than $r$. A well-celebrated result due to Lov\'asz says that for such graphs the linear system $Ax = \textbf{1}$ has a solution in $\mathbb{Z}/2$, where $A$ is the $0,1$ edge…
This is the first part of a threefold article, aimed at solving numerically the Poisson problem in three-dimensional prismatic or axisymmetric domains. In this first part, the Fourier Singular Complement Method is introduced and analysed,…
The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V…
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…
We consider a wave equation with a nonlocal logarithmic damping depending on a small parameter $\theta \in (0,1/2)$. This research is a counter part of that was initiated by Charao-D'Abbicco-Ikehata considered in [5] for the large parameter…
In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
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 Bures metric and the associated Bures-Hall measure is arguably the best choice for studying the spectrum of the quantum mechanical density matrix with no apriori knowledge of the system. We investigate the probability of a gap in the…