Related papers: Virial Expansion Bounds Through Tree Partition Sch…
In the 1960s, the technique of using cluster expansion bounds in order to achieve bounds on the virial expansion was developed by Lebowitz and Penrose (1964) and Ruelle (1969). This technique is generalised to more recent cluster expansion…
We establish new lower bounds for the convergence radius of the Mayer series and the Virial series of a continuous particle system interacting via a stable and tempered pair potential. Our bounds considerably improve those given by Penrose…
We study the convergence of cluster and virial expansions for systems of particles subject to positive two-body interactions. Our results strengthen and generalize existing lower bounds on the radii of convergence and on the value of the…
We study the virial expansion of mixtures of countably many different types of particles. The main tool is the Lagrange-Good inversion formula, which has other applications such as counting coloured trees or studying probability generating…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…
We revisit the classical approach to cluster expansions, based on tree graphs, and establish a new convergence condition that improves those by Kotecky-Preiss and Dobrushin, as we show in some examples. The two ingredients of our approach…
We have computed by a Monte Carlo method the fourth virial coefficient of free anyons, as a function of the statistics angle theta. It can be fitted by a four term Fourier series, in which two coefficients are fixed by the known…
We adapt and extend the Montiel-Ros methodology to compact manifolds with boundary, allowing for mixed (including oblique) boundary conditions and also accounting for the action of a finite group $G$ together with an additional twisting…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
A generalized version of Groeneveld's convergence criterion for the virial expansion and generating functionals for weighted $2$-connected graphs is proven. The criterion works for inhomogeneous systems and yields bounds for the density…
Using schematic model potentials, we calculate exactly the virial coefficients of a classical gas up to sixth order and use them to assess the convergence properties of the virial expansion of basic thermodynamic quantities such as…
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We consider a mixture of non-overlapping rods of different lengths $\ell_k$ moving in $\mathbb{R}$ or $\mathbb{Z}$. Our main result are necessary and sufficient convergence criteria for the expansion of the pressure in terms of the…
In this paper we obtain explicit lower bounds for the radius of convergence of the Painlev\'e expansions of the Korteweg-de-Vries equation around a movable singularity manifold ${\Cal S}$ in terms of the sup norms of the arbitrary functions…
We give a solution to the Poincar\'e Problem, in the formulation of Cerveau and Lins Neto. We obtain a bound on the degree of general leaves of foliations of general type, which is linear in $g$. To achieve this we study the birational…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that…
The paper introduces a PDE model for the growth of a tree stem or a vine. The equations describe the elongation due to cell growth, and the response to gravity and to external obstacles. An additional term accounts for the tendency of a…