Related papers: Partition functions and the continuum limit in Pen…
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
Infinite families of multi-indexed orthogonal polynomials are discovered as the solutions of exactly solvable one-dimensional quantum mechanical systems. The simplest examples, the one-indexed orthogonal polynomials, are the infinite…
The use of orthogonal polynomials for integral models on the lattice is applied to the 3nj-symbols that appear in the coupling of several angular momenta. These symbols are connected to the Ponzano-Regge method to solve the Einstein…
We compute the free energy of the planar monomer-dimer model. Unlike the classical planar dimer model, an exact solution is not known in this case. Even the computation of the low-density power series expansion requires heavy and nontrivial…
We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary…
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we…
We present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, the random cluster model, for arbitrary temperature on $n$-vertex ladder graphs with free, cyclic, and M\"obius…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
We obtain the double scaling asymptotic behavior of the recurrence coefficients and the partition function at the critical point of the $N\times N$ Hermitian random matrix model with cubic potential. We prove that the recurrence…
We consider some non-linear non-homogeneous partial differential equations (PDEs) and derive their exact Green function solution as a functional Taylor expansion in powers of the source. The kind of PDEs we consider are dispersive ones…
A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…
This paper discusses Random Matrix Models which exhibit the unusual phenomena of having multiple solutions at the same point in phase space. These matrix models have gaps in their spectrum or density of eigenvalues. The free energy and…
We analyze two conditionally solvable quantum-mechanical models: a one-dimensional sextic oscillator and a perturbed Coulomb problem. Both lead to a three-term recurrence relation for the expansion coefficients. We show diagrams of the…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support an infinite tridiagonal matrix representation of the wave operator. The class of solutions obtained as such…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
We solve the puzzle of the disagreement between orthogonal polynomials methods and mean field calculations for random NxN matrices with a disconnected eigenvalue support. We show that the difference does not stem from a Z2 symmetry…
Exactly solvable two-dimensional polygon models, counted by perimeter and area, are described by $q$-algebraic functional equations. We provide techniques to extract the scaling behaviour of these models up to arbitrary order and apply them…
We study the problem of approximating orthogonal matrices so that their application is numerically fast and yet accurate. We find an approximation by solving an optimization problem over a set of structured matrices, that we call extended…
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an…
Based on discrete truncated powers, the beautiful Popoviciu's formulation for restricted integer partition function is generalized. An explicit formulation for two dimensional multivariate truncated power functions is presented. Therefore,…