Related papers: Error bounds for the asymptotic expansion of the p…

We carry out the asymptotic analysis as $n \to \infty$ of a class of orthogonal polynomials $p_{n}(z)$ of degree $n$, defined with respect to the planar measure \begin{equation*} d\mu(z) = (1-|z|^{2})^{\alpha-1}|z-x|^{\gamma}\mathbf{1}_{|z|…

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

The partition function $p(n)$ has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the "circle method" to estimate the size of $p(n)$, which was later perfected…

Let $K(=K_{n,\theta})$ be a positive integer-valued random variable whose distribution is given by ${\rm P}(K = x) = \bar{s}(n,x) \theta^x/(\theta)_n$ $(x=1,\ldots,n) $, where $\theta$ is a positive number, $n$ is a positive integer,…

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 $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…

A recent asymptotic expansion for the positive zeros $x=j_{\nu,m}$ ($m=1,2,3,\ldots$) of the Bessel function of the first kind $J_{\nu}(x)$ is studied, where the order $\nu$ is positive. Unlike previous well-known expansions in the…

A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…

We obtain large N asymptotics for the Hermitian random matrix partition function \[Z_N(V)=\int_{\mathbb R^N}\prod_{i<j}(x_i-x_j)^2 \prod_{j=1}^N e^{-N V(x_j)}dx_j,\] in the case where the external potential $V$ is a polynomials such that…

The partition crank is a statistic on partitions introduced by Freeman Dyson to explain Ramanujan's congruences. In this paper, we prove that the crank is asymptotically equidistributed modulo Q, for any odd number Q. To prove this, we…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincar{\'e}-type expansions for large values of the argument $z$ and uniform…

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…

The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\delta)$:= (relative transmission rate, relative minimal…

In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…

Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math)…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

Given two arithmetical functions $f,g$ we derive, under suitable conditions, asymptotic formulas with error term, for the convolution sums $\sum_{n \le N} f(n) g(n+h)$, building on an earlier work of Gadiyar, Murty and Padma. A key role in…