Related papers: Inequalities for the overpartition function
In 2019, Andrews investigated integer partitions in which all parts of a given parity are smaller than those of the opposite parity and introduced eight partition functions based on the parity of the smaller parts and parts of a given…
Singular overpartitions, which are defined by George Andrews, are overpartitions whose Frobenius symbols have at most one overlined entry in each row. In his paper, Andrews obtained interesting combinatorial results on singular…
We prove a parabolic analogue of Wolff's inequality adapted to the intrinsic scaling $\delta_c(x,t)=(cx,c^2t)$ and formulated in terms of time-backward parabolic dyadic rectangles. As a consequence, we obtain equivalent characterizations of…
We prove bilinear inequalities for differential operators in $\mathbb{R}^2$. Such type inequalities turned out to be useful for anisotropic embedding theorems for overdetermined systems and the limiting order summation exponent. However,…
For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…
Let $\mathcal{V}_p(\lambda)$ be the collection of all functions $f$ defined in the unit disc $\ID$ having a simple pole at $z=p$ where $0<p<1$ and analytic in $\ID\setminus\{p\}$ with $f(0)=0=f'(0)-1$ and satisfying the differential…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
Peng, S. (\cite{P08b}) proved the law of large numbers under a sublinear expectation. In this paper, we give its error estimates by Stein's method.
Due to the invalidation of the Gauss-Lucas type result for quaternionic polynomials, we first give in this paper an alternative proof of the Bernstein inequality in $L^{p} (1\leq p \leq+\infty)$ for slice regular polynomials by the Fej\'er…
Different types of sinc integrals are investigated when the standard sine function is replaced by the generalised $\sin_{p,q}$ in two parameters. A striking generalisation of the improper Dirichlet integral is achieved. A second surprising…
In 1964, Erd\H{o}s proposed the problem of estimating the Tur\'an number of the $d$-dimensional hypercube $Q_d$. Since $Q_d$ is a bipartite graph with maximum degree $d$, it follows from results of F\"uredi and Alon, Krivelevich, Sudakov…
In 2017, Andrews, Dixit, Schultz and Yee introduced the function $\overline{\textrm{spt}}_\omega(n)$, which denotes the number of smallest parts in the overpartitions of $n$ in which the smallest part is always overlined and all odd parts…
Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…
A new inequality, $(x)^{p}+(1-x)^{\frac{1}{p}}\leq1$ for $p \geq 1$ and $\frac{1}{2} \geq x \geq 0$ is found and proved. The inequality looks elegant as it integrates two number pairs ($x$ and $1-x$, $p$ and $\frac{1}{p}$) whose summation…
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows the maximum number of $q$-colorings among graphs with $n$ vertices and $m$ edges. Let $T_r(n)$ denote the Tur\'{a}n graph - the complete…
Let $P(z)$ be a polynomial of degree $n,$ then it is known that for $\alpha\in\mathbb{C}$ with $|\alpha|\leq \frac{n}{2},$ \begin{align*} \underset{|z|=1}{\max}|\left|zP^{\prime}(z)-\alpha P(z)\right|\leq…
The Dominative $p$-Laplace Operator is introduced. This operator is a relative to the $p$-Laplacian, but with the distinguishing property of being sublinear. It explains the superposition principle in the $p$-Laplace Equation.
We present some Euler-type recurrences for the partition function $p(n)$.
Inequalities are important features in the context of sequences of numbers and polynomials. The Bessenrodt--Ono inequality for partition numbers and Nekrasov--Okounkov polynomials has only recently been discovered. In this paper we study…
In this paper, we establish some upper bounds for numerical radius inequalities including of $2\times 2$ operator matrices and their off-diagonal parts. Among other inequalities, it is shown that if $T=\left[\begin{array}{cc} 0&X, Y&0…