Related papers: Generating functions for purely crossing partition…
We introduce a general class of generating functionals for the calculation of quantum-mechanical expectation values of arbitrary functionals of fluctuating paths with fixed end points in configuration or momentum space. The generating…
We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…
We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…
Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
A partition $\alpha$ is said to contain another partition (or pattern) $\mu$ if the Ferrers board for $\mu$ is attainable from $\alpha$ under removal of rows and columns. We say $\alpha$ avoids $\mu$ if it does not contain $\mu$. In this…
We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…
Anderson generating functions are generating series for division values of points on Drinfeld modules, and they serve as important tools for capturing periods, quasi-periods, and logarithms. They have been fundamental in recent work on…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
In the context of phase-space quantization, matrix elements and observables result from integration of c-number functions over phase space, with Wigner functions serving as the quasi-probability measure. The complete sets of Wigner…
There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…
Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…
We present an explicit construction of a Markovian random growth process on integer partitions such that given it visits some level $n$, it passes through any partition $\lambda$ of $n$ with equal probabilities. The construction has…
Let $N(n,r,k)$ denote the number of binary words of length $n$ that begin with $0$ and contain exactly $k$ runs (i.e., maximal subwords of identical consecutive symbols) of length $r$. We show that the generating function for the sequence…
The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. In part I, we studied the behavior of coefficients in the partial fraction decomposition of this…
We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…