Related papers: State matrix recursion method and monomer--dimer p…
The correlation functions of an arbitrary number of boundary monomers in the system of close-packed dimers on the square lattice are computed exactly in the scaling limit. The equivalence of the 2n-point correlation functions with those of…
We consider nine geometric systems: Miquel dynamics, P-nets, integrable cross-ratio maps, discrete holomorphic functions, orthogonal circle patterns, polygon recutting, circle intersection dynamics, (corrugated) pentagram maps and the short…
Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent…
Di Francesco conjectured in 2021 that the number of domino tilings of a certain family of regions -- called Aztec triangles -- on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign…
In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…
I review aspects of work done in collaboration with A. Zee and R. Scalettar \cite{fz1,fz2,fsz} on complex non-hermitean random matrices. I open by explaining why the bag of tools used regularly in analyzing hermitean random matrices cannot…
Using Kasteleyn's determinant method, we count perfect matchings of rectangular subgraphs of the square grid.
New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences.…
The trigonometric six-vertex model with domain wall boundary conditions and one partially reflecting end on a lattice of size $2n\times m$, $m\leq n$, is considered. The partition function is computed using the Izergin-Korepin method,…
Motivated by the problem of domino tilings of the Aztec diamond, a weighted particle system is defined on $N$ lines, with line $j$ containing $j$ particles. The particles are restricted to lattice points from 0 to $N$, and particles on…
Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
Using exact computations we study the classical hard-core monomer-dimer models on m x n plane lattice strips with free boundaries. For an arbitrary number v of monomers (or vacancies), we found a logarithmic correction term in the…
We consider matrix-model representations of the meander problem which describes, in particular, combinatorics for foldings of closed polymer chains. We introduce a supersymmetric matrix model for describing the principal meander numbers.…
The thermodynamic limit is foundational to statistical mechanics, underlying our understanding of many-body phases. It assumes that, as the system size grows infinitely at fixed density of particles, unambiguous macroscopic phases emerge…
We present a detailed study of a model of close-packed dimers on the square lattice with an interaction between nearest-neighbor dimers. The interaction favors parallel alignment of dimers, resulting in a low-temperature crystalline phase.…
A variant of White's density matrix renormalisation group scheme which is designed to compute low-lying energies of one-dimensional quantum lattice models with a large number of degrees of freedom per site is described. The method is tested…
Recently an expansion as a power series in 1/d has been presented for the specific entropy of a complete dimer covering of a d-dimensional hypercubic lattice. This paper extends from 3 to 10 the number of terms known in the series. Likewise…
We consider ergodic translation-invariant Gibbs measures for the dimer model (i.e. perfect matchings) on the hexagonal lattice. The complement to a dimer configuration is a fully-packed loop configuration: each vertex has degree two. This…
A completion problem to recover a rational matrix function which is j-unitary on the line is treated. A Dirac type system with singularities on the semiaxis is recovered explicitly by its left reflection coefficient. The close connection…