Related papers: On a nonlinear relation for computing the overpart…

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…

We consider radial solutions of equations with the $p$-Laplace operator in $R^n$. We introduce a change of variables, which in effect removes the singularity at $r=0$. While solutions are not of class $C^2$, in general, we show that…

We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…

Singular overpartitions, which are defined by George Andrews, are overpartitions whose Frobenius symbols have at most one overlined entry in each row. In his paper, Andrews obtained interesting combinatorial results on singular…

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…

This paper proposes an easy-to-compute upper bound for the overlap index between two probability distributions without requiring any knowledge of the distribution models. The computation of our bound is time-efficient and memory-efficient…

In basic computational physics classes, students often raise the question of how to compute a number that exceeds the numerical limit of the machine. While technique of avoiding overflow/underflow has practical application in the electrical…

A sequence of $\{a_n\}_{n\ge 0}$ satisfies the Briggs inequality if \begin{align*} a_n^2(a_n^2-a_{n-1}a_{n+1})>a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{align*} holds for any $n\ge 1$. In this paper we show that both the partition function…

In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is…

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…

This document is a companion for the Maple program : Discrete series and K-types for U(p,q) available on:http://www.math.jussieu.fr/~vergne We explain an algorithm to compute the multiplicities of an irreducible representation of U(p)x U(q)…

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…

In 1917, G.H.Hardy and S.Ramanujan proved that the `typical' number of prime factors of a positive integer $n$ is approximately $\ln\ln n$. In this technical paper we proffer a complete exposition of this proof, and further provide novel…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…

Let $\mathcal{V}_p(\lambda)$ be the collection of all functions $f$ defined in the unit disc $\ID$ having a simple pole at $z=p$ where $0<p<1$ and analytic in $\ID\setminus\{p\}$ with $f(0)=0=f'(0)-1$ and satisfying the differential…

In this paper, we study the Koshliakov zeta function $\eta_p(s)$, whose theory appears to be more involved than that of its counterpart $\zeta_p(s)$, owing to the fact that its defining series is not of Dirichlet type. We derive formulas…

Recently, Gireesh, Ray, and Shivashankar studied an analog, $\overline{a}_t(n)$, of the $t$-core partition function, $c_t(n)$. In this paper, we study the function $\overline{a}_5(n)$ in conjunction with $c_5(n)$ as well as another…

We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…