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

We present some Euler-type recurrences for the partition function $p(n)$.

We use an interpolative technique from \cite{abps} to introduce the notion of multiple $N$-separately summing operators. Our approach extends and unifies some recent results; for instance we recover the best known estimates of the…

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

Let $\overline{B}_{s,t}(n)$ denote the number of overpartitions of $n$ where no part is divisible by $s$ or $t$, with $s$ and $t$ being coprime. By establishing the exact generating functions of a family of arithmetic progressions in…

We study $H^p$ spaces of Dirichlet series, called $\mathcal{H}^p$, for the range $0<p< \infty$. We begin by showing that two natural ways to define $\mathcal{H}^p$ coincide. We then proceed to study some linear space properties of…

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

We study some arithmetic properties of the Ramanujan function $\tau(n)$, such as the largest prime divisor $P(\tau(n))$ and the number of distinct prime divisors $\omega(\tau(n))$ of $\tau(n)$ for various sequences of $n$. In particular, we…

We compute the modular transformation formula of the characters for a certain family of (finitely or uncountably many) simple modules over the simple $\mathcal{N}=2$ vertex operator superalgebra of central charge…

It is commonly known that $\zeta(2k) = q_{k}\frac{\zeta(2k + 2)}{\pi^2}$ with known rational numbers $q_{k}$. In this work we construct recurrence relations of the form $\sum_{k = 1}^{\infty}r_{k}\frac{\zeta(2k + 1)}{\pi^{2k}} = 0$ and show…

We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply…

Let $p\leq 23$ be a prime and $a_p(n)$ counts the number of partitions of $n$ where parts that are multiple of $p$ come up with $2$ colors. Using a result of Sussman, we derive the exact formula for $a_p(n)$ and obtain an asymptotic formula…

We define $\overline{R_l^*}(n)$ as the number of overpartitions of $n$ in which non-overlined parts are not divisible by $l$. In a recent work, Nath, Saikia, and the second author established several families of congruences for…

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

In this paper, we establish some expressions of series involving harmonic numbers and Stirling numbers of the first kind in terms of multiple zeta values, and present some new relationships between multiple zeta values and multiple zeta…

Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989 when den Boer proposed a protocol to compute the logical AND function using five cards. Since then,…

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

A formula for supershell partition functions, which play a major role in the Super Transition Array approach to radiative-opacity calculations, is derived as a functional of the distribution of energies within the supershell. It consists in…

The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a…

We prove a simple sufficient criteria to obtain some Hardy inequalities on Riemannian manifolds related to quasilinear second-order differential operator $\Delta_{p}u := \Div(\abs{\nabla u}^{p-2}\nabla u)$. Namely, if $\rho$ is a…

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…