Related papers: State matrix recursion method and monomer--dimer p…
Ground-state and finite-temperature behaviour of the mixed spin-1/2 and spin-1 Ising-Heisenberg model on decorated planar lattices consisting of inter-connected diamonds is investigated by means of the generalised decoration-iteration…
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 study the enumeration of off-diagonally symmetric domino tilings of odd-order Aztec diamonds in two directions: (1) with one boundary defect, and (2) with maximally-many zeroes on the diagonal. In the first direction, we prove a symmetry…
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…
Our goal is to prove new results in graph theory and combinatorics thanks to the speed of computers, used with smart algorithms. We tackle four problems. The four-colour theorem states that any map whose countries are connected can be…
We present a theoretical method to study driven-dissipative correlated systems on lattices with two spatial dimensions (2D). The steady-state density-matrix of the lattice is obtained by solving the master equation in a corner of the…
We evaluate the density of states (DOS) associated with tridiagonal symmetric Hamiltonian matrices and study the effect of perturbation on one of its entries. Analysis is carried out by studying the resulting three-term recursion relation…
We develop a density matrix renormalization group (DMRG) algorithm for constrained quantum lattice models that successfully {\it{implements the local constraints as symmetries in the contraction of the matrix product states and matrix…
Density matrix perturbation theory (DMPT) is known as a promising alternative to the Rayleigh-Schr\"odinger perturbation theory, in which the sum-over-state (SOS) is replaced by algorithms with perturbed density matrices as the input…
We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of a sequence of finite graphs converging to L. This allows us…
The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix…
The $N$-representability problem places fundamental constraints on reduced density matrices (RDMs) that originate from physical many-fermion quantum states. Motivated by recent developments in functional theories, we introduce a hierarchy…
We study the dimer-dimer scattering length $a_4$ for a two-component Fermi mixture in which the different fermions have different masses $m\us$ and $m\ds$. This is made in the framework of the exact field theoretical method. In the large…
We construct a generalized quantum dimer model on two-dimensional nonbipartite lattices including the triangular lattice, the star lattice and the kagome lattice. At the Rokhsar-Kivelson (RK) point, we obtain its exact ground states that…
We consider the monomer-dimer partition function on arbitrary finite planar graphs and arbitrary monomer and dimer weights, with the restriction that the only non-zero monomer weights are those on the boundary. We prove a Pfaffian formula…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…
We consider a Hidden Markov Model (HMM) where the integrated continuous-time Markov chain can be observed at discrete time points perturbed by a Brownian motion. The aim is to derive a filter for the underlying continuous-time Markov chain.…
We filled a void with a regular or asymmetric pattern without overlap using a time-dependent packing method termed random sequential adsorption (RSA). In the infinite-time limit, the density of coverage frequently hits a limit. This study…
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky.…