Related papers: Exact formula for 1-lower run overpartitions
In this paper we prove an exact formula for the number of partitions without sequences. By work of Andrews, the corresponding generating function is a product of a modular form and a mock theta function, giving an overall weight of 0. The…
In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a…
In 1939, H. S. Zuckerman provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the overpartition function $\overline{p}(n)$. Computing $\overline{p}(n)$ by this method requires…
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
Recently, the concept of generating function has been employed in one-loop reduction. For one-loop integrals encompassing arbitrary tensor ranks and higher-pole contributions, the generating function can be decomposed into a tensor part and…
In a previous paper a new approach has been introduced for computing, recursively and numerically, one-loop tensor integrals. Here we describe a few modifications of the original method that allow a more efficient numerical implementation…
Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…
We calculate the one loop partition function for topologically massive higher spin gravity (TMHSG) for arbitrary spin by taking the spin-3 TMHSG action constructed in arXiv:1107.0915 and subsequently generalising it for an arbitrary spin.…
This article is the second of a series of three presenting an alternative method to compute the one-loop scalar integrals. It extends the results of the first article to general complex masses. Let us remind the main features enjoyed by…
In this paper we introduce k-run overpartitions as natural analogs to partitions without k-sequences, which were first defined and studied by Holroyd, Liggett, and Romik. Following their work as well as that of Andrews, we prove a number of…
In 2009, Bringmann arXiv:0708.0691 [math.NT] used the circle method to prove an asymptotic formula for the Fourier coefficients of rank generating functions. In this paper, we prove that Bringmann's formula, when summing up to infinity and…
In this thesis, we construct a half-integral weight multiplier system on the group SU(2,1). In order to do so, we first find a formula for a 2-cocycle representing the double cover of SU(2,1)(k), where k is a local field. For each…
The unitarity method for calculating one-loop amplitudes provides algorithms of polynomial complexity. This is primarily beneficial for the computation of multi-leg one loop amplitudes and it is therefore of great interest to develop a…
In this paper, we construct four binary linear codes closely connected with certain exponential sums over the finite field F_q and F_q-{0,1}. Here q is a power of two. Then we obtain four recursive formulas for the power moments of…
We present a semi-recursive method for calculating the rational parts of one-loop amplitudes when recursion produces double poles. We illustrate this with the graviton scattering amplitude M^{1-loop}(1-, 2+, 3+, 4+, 5+).
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(\epsilon_{\rm…
An overpartition is a partition such that the first occurrence (equivalently, the last occurrence) of a number may be overlined. In this article, we investigate three contents of overpartitions. We first consider the $r$-chain minimal and…
We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…
We prove formulas for generalized rank deviations for overpartitions. These formulas are in terms of Appell-Lerch series and sums of quotients of theta functions and extend work of Lovejoy and the second author. As an application, we…
In this paper we develop a method to calculate the overpartition function efficiently using a Hardy-Rademacher-Ramanujan type formula, and we use this method to find many new Ramanujan-style congruences, whose existence is predicted by…