相关论文: Asymptotic density and the asymptotics of partitio…

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…

The sizes of subsets of the natural numbers are typically quantified in terms of asymptotic (linear) and logarithmic densities. These concepts have been generalized to weighted $w$-densities, where a specific weight function $w$ plays a key…

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

We consider two multiplicative statistics on the set of integer partitions: the norm of a partition, which is the product of its parts, and the supernorm of a partition, which is the product of the prime numbers $p_i$ indexed by its parts…

Recently, Debruyne and Tenenbaum proved asymptotic formulas for the number of partitions with parts in $\mathcal{L}\subset\mathbb{N}$ ($\gcd(\mathcal{L})=1$) and good analytic properties of the corresponding zeta function, generalizing work…

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

We obtain asymptotic bounds on the number of natural numbers less than $X$ satisfying $\gcd{\left(n,\lfloor P(n) \rfloor\right)}=1$, under some diophantine conditions on the coefficient of $x$ in $P$, and show that the density of such…

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…

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

In 2013, Sun conjectured that the partition function $p(n)$ is never a perfect power for $n \geq 2$. Building on this, Merca, Ono, and Tsai recently observed that for any fixed integers $d \geq 0$ and $k \geq 2$, there appear to be only…

A system of linear differential equations with oscillatory decreasing coefficients is considered. The coefficients has the form $t^{-\alpha}a(t)$,~$\alpha>0$, where $a(t)$ is trigonometric polynomial with an arbitrary set of frequencies.…

We classify the asymptotic densities of the $\Delta^0_2$ sets according to their level in the Ershov hierarchy. In particular, it is shown that for $n \geq 2$, a real $r \in [0,1]$ is the density of an $n$-c.e.\ set if and only if it is a…

We study the asymptotic behavior of solid partitions using transition matrix Monte Carlo simulations. If $p_3(n)$ denotes the number of solid partitions of an integer $n$, we show that $\lim_{n\rightarrow\infty} n^{-3/4} \log p_3(n)\sim…

We give an alternative method to that of Hardy-Ramanujan-Rademacher to derive the leading exponential term in the asymptotic approximation to the partition function p(n,a), defined as the number of decompositions of a positive integer 'n'…

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

In this article, we study the properties of $\psi$-amicable numbers. We prove that their asymptotic density relative to the positive integers is zero. We also propose generalizations of $\psi$-amicable numbers.

We extend recent results on the Asymptotic Equipartition Property for the density of $n$ particles in $\beta$-ensembles, as $n$ tends to infinity. We prove the Large Deviation Principle of the log-density for a general potential and the…

Let W be an affine PI algebra over a field of characteristic zero graded by a finite group G. We show that there exist $\alpha_{1},\alpha_{2}\in\mathbb{R}, \beta\in\frac{1}{2}\mathbb{Z}$, and $l\in\mathbb{N}$ such that…