Related papers: Tur\'an Inequalities for Infinite Product Generati…

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

We prove log-concavity for the function counting partitions without sequences. We use an exact formula for a mixed-mock modular form of weight zero, explicit estimates on modified Kloosterman sums and analytic techniques. Finally, we…

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

Let $g$ and $h$ be real-valued arithmetic functions, positive and normalized. Specific choices within the following general scheme of recursively defined polynomials \begin{equation*} P_n^{g,h}(x):= \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \,…

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

Let p(n) denote the number of unrestricted partitions of n. For i=0, 2, let p[i](n) denote the number of partitions pi of n such that O(pi) - O(pi') = i mod 4. Here O(pi) denotes the number of odd parts of the partition pi and pi' is the…

Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…

We consider infinite sequences of positive numbers. The connection between log-concavity and the Bessenrodt--Ono inequality had been in the focus of several papers. This has applications in the white noise distribution theory and…

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

We obtain an asymptotic formula for Andrews and Paule's broken $k$-diamond partition function $\Delta_k(n)$ where $k=1$ or $2$. Based on this asymptotic formula, we derive that $\Delta_k(n)$ satisfies the order $d$ Tur\'an inequalities for…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we obtain an inequality for the sequence $\Delta^{2}\log \ \sqrt[n-1]{\overline{p}(n-1)/(n-1)^{\alpha}}$ which states that \begin{equation*} \log…

Let $\overline{p}(n)$ denote the overpartition funtion. This paper presents the $2$-$\log$-concavity property of $\overline{p}(n)$ by considering a more general inequality of the following form \begin{equation*} \begin{vmatrix}…

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…

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

The partition function $ p_{[1^c\ell^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{\ell}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{\ell n})^d}.\] In \cite{P}, we proved infinite family of…

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…