相关论文: Asymptotics for rank partition functions
In this paper, we study three asymptotic regimes that can be applied to ranking and selection (R&S) problems with general sample distributions. These asymptotic regimes are constructed by sending particular problem parameters (probability…
We present an asymptotic evaluation unitary formula for large argument values existing for defined class of functions. The asymptotic evaluation is obtained using only power series expansion coefficients of a function, what is a new result…
We compute an asymptotic estimate for odd balanced unimodal sequences for ranks congruent to $a \pmod{c}$ for $c\neq 1$ odd. We find the interesting result that the odd balanced unimodal sequences are asymptotically related to the…
We define the asymptotic behavior "almost everywhere" of additive and multiplicative arithmetic functions in the paper. Classes of additive and multiplicative arithmetic functions are singled out for which the asymptotics coincides "almost…
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
Inspired by the works of Dewar, Murty and Kot\v{e}\v{s}ovec, we establish some useful theorems for asymptotic formulas. As an application, we obtain asymptotic formulas for the numbers of skew plane partitions and cylindric partitions. We…
Motivated by several conjectures posed in the paper " Completely monotonic degrees for a difference between the logarithmic and psi functions",we confirm in this work some conjectures on completely monotonic degrees of remainders of the…
We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…
Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…
An asymptotic expansion for a ratio of products of gamma functions is derived.
Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…
Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion…
We derive asymptotic formulas for the number of integer partitions with given sums of $j$th powers of the parts for $j$ belonging to a finite, non-empty set $J \subset \mathbb N$. The method we use is based on the `principle of maximum…
The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…
In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to…
Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…
We give an asymptotic equivalent at infinity of the unbounded solutions of some boundary layer equations arising in fluid mechanics.
Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.
In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…