Related papers: A partition formula from idempotents
We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
Roughly speaking, Buckingham's $\Pi$-Theorem provides a method to "guess" the structure of physical formulas simply by studying the dimensions (the physical units) of the involved quantities. Here we will prove a quantitative version of…
The quantum master equation is usually formulated in terms of functionals of the components of mappings from a space-time manifold M into a finite-dimensional vector space. The master equation is the sum of two terms one of which is the…
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.
We generalize the generating formula for plane partitions known as MacMahon's formula as well as its analog for strict plane partitions. We give a 2-parameter generalization of these formulas related to Macdonald's symmetric functions. The…
It is well-known that the coefficients in Faa di Bruno's chain rule for higher derivatives can be expressed via numeration of partitions. It turns out that this has a natural form as a formula for the vector case. To this formula two proofs…
Sampling formulas describe probability laws of exchangeable combinatorial structures like partitions and compositions. We give a brief account of two known parametric families of sampling formulas and add a new family to the list.
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…
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…
We perform the calculation of the partition function of the Poisson-sigma model on the world sheet with the topology of a two-dimensional disc. Considering the special case of a linear Poisson structure we recover the partition function of…
We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.
A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…
Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…
In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…