Related papers: Higher Order Tur\'an Inequalities for the Partitio…

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…

We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…

Some Tur\'an type inequalities for Struve functions of the first kind are deduced by using various methods developed in the case of Bessel functions of the first and second kind. New formulas, like Mittag-Leffler expansion, infinite product…

Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of…

For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with…

Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. The random Tur\'an number $\mathrm{ex}(G^r_{n,p},\mathcal{F})$ is the maximum number of edges in an $\mathcal{F}$-free subgraph of $G^r_{n,p}$, where $G^r_{n,p}$ is the…

In this paper we prove higher order Poincar\'e inequalities involving radial derivatives namely, \begin{equation*} \int_{\mathbb{H}^{N}} |\nabla_{r,\mathbb{H}^{N}}^{k} u|^2 \, {\rm d}v_{\mathbb{H}^{N}} \geq…

Inequalities among symmetric polynomial functions are fundamental questions in mathematics and have various applications in science and engineering. This paper investigates a beautiful and inspiring conjecture, proposed by Cuttler, Greene…

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…

The Tur\'an number of a graph $H$, denoted by $ex(n, H)$, is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. Let $P_{\ell}$ denote the path on $\ell$ vertices, $S_{\ell-1}$ denote the star on $\ell$…

We prove that the following pointwise inequality holds \begin{equation*} -\Delta u \ge \sqrt\frac{2}{(p+1)-c_n} |x|^{\frac{a}{2}} u^{\frac{p+1}{2}} + \frac{2}{n-4} \frac{|\nabla u|^2}{u} \ \ \text{in}\ \ \mathbb{R}^n \end{equation*} where…

In this paper, we obtain a $p$-th moment bound for the suprema of a log-concave-tailed nonhomogeneous chaos process, which is optimal in some special cases. A crucial ingredient of the proof is a novel decoupling inequality, which may be of…

Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…

In this paper first we survey the Tur\'an type inequalities and related problems for the Bessel functions of the first kind. Then we extend the known higher order Tur\'an type inequalities for Bessel functions of the first kind to real…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…