Related papers: Partial fraction decompositions and an algorithm f…
We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…
In this paper, we consider a class of nonconvex and nonsmooth fractional programming problems, that involve the sum of a convex, possibly nonsmooth function composed with a linear operator and a differentiable, possibly nonconvex function…
We calculate the partition function for "composite particles". For any finite number of states d, and in the following two cases: 1)all states have the same energy, 2)the energy is linearly distributed over the states, we transform the…
This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number of new reformulations and relaxations for fractional…
Recently, Merca and Schmidt found some decompositions for the partition function $p(n)$ in terms of the classical M\"{o}bius function as well as Euler's totient. In this paper, we define a counting function $T_k^r(m)$ on the set of…
Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While shared-memory parallel partitioners have recently matured to…
Using previous work by Merca, we show the partition function involving parts of k different magnitudes, shifted by the triangular numbers, equals the self convolution of the unrestricted partition function. We also provide a combinatorial…
We compute the canonical partition function Z of non-interacting conformal higher spin (CHS) theory viewed as a collection of free spin s CFT's in R^d. We discuss in detail the 4-dimensional case (where s=1 is the standard Maxwell vector,…
The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…
We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internally while sparsely connected to the rest of the graph. In…
In the present paper we introduce the class of slice-polynomial functions: slice regular functions {defined over the quaternions, outside the real axis,} whose restriction to any complex half-plane is a polynomial. These functions naturally…
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…
By means of partial fraction method, we investigate the decomposition of rational functions. Several striking identities on harmonic numbers and generalized Apery numbers will be established, including the binomial-harmonic number identity…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
We study a family of identities regarding a divisibility property of the Kostant partition function which first appeared in a paper of Baldoni and Vergne. To prove the identities, Baldoni and Vergne used techniques of residues and called…