Related papers: Rook decomposition of the Partition function
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…
We provide an exact expression of the moment of the partition function for random energy models of finite system size, generalizing an earlier expression for a grand canonical version of the discrete random energy model presented by the…
From first principles, the author gathers a few general rules that need to be abided by in the calculation of the internal partition functions (IPFs) of individual molecules. These rules are violated in many schemes in the literature where…
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…
Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice…
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…
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…
In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…
We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…
In this paper, we study the $n$-point function of $t$-core partitions. The main tool is the topological vertex, originally developed to study the topological string theory for toric Calabi--Yau 3-folds. By virtue of the topological vertex,…
The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…
We investigate the number $N_{d,r}(s)$ of $(s, s+r)$-core integer partitions with $d$-distinct parts. Our first main result is a proof of a recurrence relation conjectured by Sahin in 2018. We also derive generating functions, asymptotics,…
We consider the Ising model on an $M\times N$ rectangular lattice with an asymmetric self-dual boundary condition, and derive a closed-form expression for its partition function. We show that zeroes of the partition function are given by…
Theoretical prediction of oscillations of cumulant moments of parton multiplicity distributions inside a jet supported by experimental data in some multiple production processes asks for analysis of the phenomenon for the whole set of…
We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…
We derive asymptotic formulas for the number of integer partitions with given sums of $j$th powers of the parts for $j$ belonging to a finite, non-empty set $J \subset \mathbb N$. The method we use is based on the `principle of maximum…
A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…
In this article we are interested in studying partitions of the square, the disk and the equilateral triangle which minimize a p-norm of eigenvalues of the Dirichlet-Laplace operator. The extremal case of the infinity norm, where we…