Related papers: Proposal of a generating function of partition seq…
In the paper, a theoretical work is done for investigating effects of splitting data sequence into packs of data set. We proved that a partitioning of data sequence is possible to find such that the entropy rate at each subsequence is lower…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
We prove formulas for the generating functions for M_2-rank differences for partitions without repeated odd parts. These formulas are in terms of modular forms and generalized Lambert series.
We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also…
We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed…
Using a simple transfer matrix approach we have derived very long series expansions for the perimeter generating function of punctured staircase polygons (staircase polygons with a single internal staircase hole). We find that all the terms…
Partition functions of eigenvalue matrix models possess a number of very different descriptions: as matrix integrals, as solutions to linear and non-linear equations, as tau-functions of integrable hierarchies and as special-geometry…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…
We verify a recent conjecture of Kenyon/Szendroi, arXiv:0705.3419, by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the…
The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
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…
We describe all Gaussian generating functionals on several easy quantum groups given by non-crossing partitions. This includes in particular the free unitary, orthogonal and symplectic quantum groups. We further characterize central…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…
We shed doubt on a commonly used manipulation in computing the partition function for a matrix valued operator together with its attendant invocation of the multiplicative anomaly.
Random matrix products arise in many science and engineering problems. An efficient evaluation of its growth rate is of great interest to researchers in diverse fields. In the current paper, we reformulate this problem with a generating…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
We use sums over integer compositions analogous to generating functions in partition theory, to express certain partition enumeration functions as sums over compositions into parts that are $k$-gonal numbers; our proofs employ Ramanujan's…