Related papers: A Rademacher-type exact formula for partitions wit…
A classical result from analytic number theory by Rademacher gives an exact formula for the Fourier coefficients of modular forms of non-positive weight. We apply similar techniques to study the spectrum of two-dimensional unitary conformal…
In this paper, we prove that the number of unimodal sequences of size $n$ is log-concave. These are coefficients of a mixed false modular form and have a Rademacher-type exact formula due to recent work of the second author and Nazaroglu on…
We prove an explicit integral formula for computing the product of two shifted Riemann zeta functions everywhere in the complex plane. We show that this formula implies the existence of infinite families of exact exponential sum identities…
We show that there is an infinite class of partition functions with world-sheet metric, space-time coordinates and first order systems, that correspond to volume forms on the moduli space of Riemann surfaces and are free of singularities at…
In this paper we employ the Circle Method to give exact formulae for Fourier coefficients of an infinite family of weight zero mixed false modular forms using and extending the techniques of Bringmann and Nazaroglu as well as Rademacher. To…
False theta functions closely resemble ordinary theta functions, however they do not have the modular transformation properties that theta functions have. In this paper, we find modular completions for false theta functions, which among…
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…
A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no…
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…
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…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
We prove that the coefficients of certain weight -1/2 harmonic Maass forms are traces of singular moduli for weak Maass forms. To prove this theorem, we construct a theta lift from spaces of weight -2 harmonic weak Maass forms to spaces of…
We study the correlators of irregular vertex operators in two-dimensional conformal field theory (CFT) in order to propose an exact analytic formula for calculating numbers of partitions, that is: 1) for given $N,k$, finding the total…
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…
We prove that the generating polynomials of partitions of an $n$-element set into non-singleton blocks, counted by the number of blocks, have real roots only and we study the asymptotic behavior of the leftmost roots. We apply this…
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…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…