相关论文: Partition functions and graphs: A combinatorial ap…
A combinatorial formula is derived which expresses free cumulants in terms of classical comulants. As a corollary, we give a combinatorial interpretation of free cumulants of classical distributions, notably Gaussian and Poisson…
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…
We give a coalgebra structure on 1-vertex irreducible graphs which is that of a cocommutative coassociative graded connected coalgebra. We generalize the coproduct to the algebraic representation of graphs so as to express a bare 1-particle…
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple…
Numerical modelling of quantum effects caused by bosonic or fermionic character of secondaries produced in high energy collisions of different sorts is at the moment still far from being established. In what follows we propose novel…
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…
An asymptotic formula for the number of states of Boson gas whose Hamiltonian is given by a positive elliptic pseudo-differential operator of order one on a compact manifold is given under a integrality assumption on the spectrum of the…
A geometrical approach to the calculation of N-point Feynman diagrams is reviewed. It is shown that the geometrical splitting yields useful connections between Feynman integrals with different momenta and masses. It is demonstrated how…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
We compute the partition function of an anyon-like harmonic oscillator. The well known results for both the bosonic and fermionic oscillators are then reobtained as particular cases as ours. The technique we employ is a non-relativistic…
Faussurier et al. [Phys. Rev. E 65, 016403 (2001)] proposed to use a variational principle relying on Jensen-Feynman (or Gibbs-Bogoliubov) inequality in order to optimize the accounting for two-particle interactions in the calculation of…
Rational-function simplification is key bottlenecks in integration-by-parts (IBP) reduction of Feynman integrals. We study denominator factorization patterns appearing in IBP coefficients and develop practical algorithms for extracting and…
We study the pattern of zeros emerging from exact partition function evaluations of Ising spin glasses on conventional finite lattices of varying sizes. A large number of random bond configurations are probed in the framework of quenched…
We introduce a method for jointly registering ensembles of partitioned datasets in a way which is both geometrically coherent and partition-aware. Once such a registration has been defined, one can group partition blocks across datasets in…
MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and inequalities. This paper aims to develop a fundamental…
The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new…
The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…