Let $p(m,n)$ denote the number of partitions of a rectangle $m\times n$ into integer-sided rectangular blocks, where two partitions are indistinguishable if they consist of the same multiset of blocks, regardless of their geometric arrangement. We present an elementary approach to show that, for every fixed positive integer $m$, $$ \log p(m,n)=\pi\sqrt{\tfrac{2mH_m}{3}}\sqrt{n}+O(\log n), \qquad \text{as }n\to\infty, $$ where $H_m$ denotes the $m$-th harmonic number. This confirms a conjecture recently posed by the authors and generalizes the Hardy--Ramanujan formula for integer partitions.
Let $\NT(m,n)$ be the total number of parts in the partitions of $n$ with rank $m$, and let $\MW(m,n)$ be the total number of ones in the partitions of $n$ with crank $m$. Using the uniform generalized-rank estimate of Liu and Zhou, we establish asymptotic formulas for $NT(m,n)$ and $\MW(m,n)$. Put $\beta_n=\pi/\sqrt{6...
Let $D_{m,n}\subset\C^{m\times n}$ be the union of the zero loci of the maximal minors of a generic $m\times n$ matrix, and let $U_{m,n}$ be its complement. We show that $U_{m,n}\cong\GL_m(\C)\times\Gr(m,n)^\circ$, where $\Gr(m,n)^\circ$ is the open stratum of the Grassmannian on which all Pl\"ucker coordinates are non...
Let $q(n)$ denote the total number of partitions of $n$ into distinct parts and $\Delta$ be the difference operator with respect to $n$. We prove that for any real number $\alpha$, there exists an integer $n(\alpha)$ such that the sequence\ $\{\sqrt[n]{q(n)/n^{\alpha } } \}_{n\ge n(\alpha) } $ is log-convex by obtainin...
Hui Guo, Zuo-Ru Zhang· Electronic Journal of Combin...· 0 citations
Following Erd\H{o}s (1982) and Sanna (2019), we study the arithmetic function $h(n)$, which is defined to be the number of distinct exponents in the prime factorization of a positive integer $n$. Among other things, we show that $$ \sum_{n\leq x}h(\phi(n)) \asymp x\left(\frac{\log\log x}{\log\log\log x}\right)^{1/2}, $...
Mikhail R. Gabdullin, V. V. Iudelevich· 0 citations
Let $n\geq 1$ be an odd integer, set $m=(n-1)/2$ and let $M$ be an $n\times n$ matrix whose coefficients are of the form $M_{i,j}=aij+bi+cj+d$ where $0\leq i,j\leq n-1$. Then we prove that for all squares centered at the central coefficient $M_{m,m}$, the mean value of the square equals $M_{m,m}$.
Let $s(n):=\sum_{d\mid n,\,d<n} d$ denote the sum of the proper divisors of $n$. Distinct positive integers $n,m$ form an amicable pair if $s(n)=m$ and $s(m)=n$. Let $A(x)$ count the positive integers not exceeding $x$ that belong to an amicable pair. We report on a proof, found by ChatGPT Astra, that $$ A(x)\le x\exp\...
P. Pollack· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
