Related papers: Unimodal Sequence Generating Functions Arising fro…
Partitions associated with mock theta functions have received a great deal of attention in the literature. Recently, Choi and Kim derived several partition identities from the third and sixth order mock theta functions. In addition, three…
We investigate the modular properties of a new partition rank, the $M_d$-rank of overpartitions. In fact this is an infinite family of ranks, indexed by the positive integer $d$, that gives both the Dyson rank of overpartitions and the…
We introduce two families of generators (functions) $\mathcal{G}$ that consist of entire and meromorphic functions enjoying a certain periodicity property and contain the classical Gaussian and hyperbolic secant generators. Sharp results…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
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,…
Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. Many algorithms exist to generate all descending compositions, yet none have previously been published to generate…
We study certain algebras of theta-like functions on partitions, for which the corresponding generating functions give rise to theta functions, quasi-Jacobi forms, Appell-Lerch sums, and false theta functions.
We initiate the systematic study of modular representations of symmetric groups that arise via the braiding in (symmetric) tensor categories over fields of positive characteristic. We determine what representations appear for certain…
We introduce and investigate a class of $\mathfrak{gl}_{M+1}$ partition functions which is an extension of the one introduced by Foda-Manabe. We characterize the partition functions by a nested version of Izergin-Korepin analysis, and…
We introduce an expressive subclass of non-negative almost submodular set functions, called strongly 2-coverage functions which include coverage and (sums of) matroid rank functions, and prove that the homogenization of the generating…
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 resolve a question by Bringmann, Lovejoy, and Rolen on a new vector-valued $U$-type function. We obtain an expression for a corresponding family of Hecke-Appell-type sums in terms of mixed mock modular forms; that is, we…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
In this article, we revisit some block matrix construction methods and use them to derive various general expansion formulas for calculating the ranks of matrix expressions. As applications, we derive a variety of interesting rank…
We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.
We connect a broad class of generative models through their shared reliance on sequential decision making. Motivated by this view, we develop extensions to an existing model, and then explore the idea further in the context of data…
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…
Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use…
Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from…
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…