Related papers: Partition functions and graphs: A combinatorial ap…
We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks,…
The algorithm to calculate the generating function for the number of ``skeleton'' diagrams for the irreducible self-energy and vertex parts is derived for the problems with Gaussian random fields. We find an exact recurrence relation…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
The statistical mechanical partition function can be used to construct different forms of phase space distributions not restricted to the Gibbs-Boltzmann factor. With a generalised Lorentzian both the Kappa-Bose and Kappa-Fermi partition…
In classical statistical mechanics, the partition function is defined in phase space. We extend this concept to quantum statistical mechanics using Bohmian trajectories. The quantum partition function in phase space captures the ensemble of…
The fundamentals of Statistical Mechanics require a fresh definition in the context of the developments in Classical Mechanics of integrable and chaotic systems. This is done with the introduction of Micro Partitions ; a union of disjoint…
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of this function. We achieve this combinatorial characterization…
In this paper, we explore the graph partitioning problem, a pivotal combina-torial optimization challenge with extensive applications in various fields such as science, technology, and business. Recognized as an NP-hard prob-lem, graph…
We discuss the supersymmetric formulation of the nonhermitian $\beta = 2$ random matrix partition function with one bosonic flavor. This partition function is regularized by adding one conjugate boson and fermion each. A supersymmetric…
We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…
One-dimensional repulsive delta-function bose system is studied. By only using the Bethe ansatz equation, n-particle partition functions are exactly calculated. From this expression for the n-particle partition function, the n-particle…
The number partitioning problem can be interpreted physically in terms of a thermally isolated non-interacting Bose gas trapped in a one-dimensional harmonic oscillator potential. We exploit this analogy to characterize, by means of a…
The equations of motion of a single particle subject to an arbitrary electric and a static magnetic field form a Poisson system. We present a second-order time integration method which preserves well the Poisson structure and compare it to…
Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…