相关论文: Partition functions and graphs: A combinatorial ap…
Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…
Using a new presentation for partition algebras (J. Algebraic Combin. 37(3):401-454, 2013), we derive explicit combinatorial formulae for the seminormal representations of the partition algebras. These results generalise to the partition…
The partition function for a system of non-interacting $N-$particles can be found by summing over all the states of the system. The classical partition function for an ideal gas differs from Bosonic or Fermionic partition function in the…
In this paper, we introduce a novel and general method for computing partition functions of solvable lattice models with free fermionic Boltzmann weights. The method is based on the ``permutation graph'' and the ``$F$-matrix'': the…
The partition function of composite bosons ("cobosons" for short) is calculated in the canonical ensemble, with the Pauli exclusion principle between their fermionic components included in an exact way through the finite temperature…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…
We find a close correspondence between certain partition functions of ideal quantum gases and certain symmetric polynomials. Due to this correspondence it can be shown that a number of thermodynamic identities which have recently been…
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…
We address a systematic combinatorial approach to the anti-normal ordering problem. In this way, we use the Stirling numbers and their generating function, the so-called Bell polynomials, together with the operational methods to anti-normal…
Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods.…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
A full treatment for the scattering of an arbitrary number of bosons through a Bell multiport beam splitter is presented that includes all possible output arrangements. Due to exchange symmetry, the event statistics differs dramatically…
We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph…
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…