相关论文: Tur\'an inequalities for the broken $k$-diamond pa…

Some sharp two-sided Tur\'an type inequalities for parabolic cylinder functions and Tricomi confluent hypergeometric functions are deduced. The proofs are based on integral representations for quotients of parabolic cylinder functions and…

For a fixed $\theta\neq 0$, we define the twisted divisor function $$ \tau(n, \theta):=\sum_{d\mid n}d^{i\theta}\ .$$ In this article we consider the error term $\Delta(x)$ in the following asymptotic formula $$ \sum_{n\leq x}^*|\tau(n,…

A well-studied statistic of an integer partition is the size of its Durfee square. In particular, the number $D_k (n)$ of partitions of $n$ with Durfee square of fixed size $k$ has a well-known simple rational generating function. We study…

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. Congruences for $d_k(n)$ modulo certain powers of primes have been proven via elementary…

We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.

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…

This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…

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…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic growth of finite difference of logarithm of $\sqrt[n]{\overline{p}(n)/n^{\alpha}}$ for $\alpha$ being a non-negative real number, namely…

P. Tur\'an was the first to derive lower estimations on the uniform norm of the derivatives of polynomials $p$ of uniform norm $1$ on the interval I:=[-1,1] and the disk D:=$\{z \in C~:~|z| \le 1\}$, under the normalization condition that…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

The deep diagonal map $T_k$ acts on planar polygons by connecting the $k$-th diagonals and intersecting them successively. The map $T_2$ is the pentagram map, and $T_k$ is a generalization. We study the action of $T_k$ on two subsets of the…

For $l,n \in \mathbb{N}$ we define tonal partition algebra $P^l_n$ over $\mathbb{Z}[\delta]$. We construct modules $\{ \Delta_{\underline{\mu}} \}_{\underline{\mu}}$ for $P^l_n$ over $\mathbb{Z}[\delta]$, and hence over any integral domain…

The method of Tur\'an in establishing the normal order for the number of prime divisors of a number is used to show that a certain class of arithmetic functions do not have a normal order.

For integers $0 < r \leq t$, let the function $D_{r,t}(n)$ denote the number of parts among all partitions of $n$ into distinct parts that are congruent to $r$ modulo $t$. We prove the asymptotic formula $$D_{r,t}(n) \sim \dfrac{3^{\frac…

A $k$-ribbon tiling is a decomposition of a connected skew diagram into disjoint ribbons of size $k$. In this paper, we establish a connection between a subset of $k$-ribbon tilings and Petrie symmetric functions, thus providing a…

In this paper we explore Kruyswijk's method and show how to obtain congruences for cubic partition. That apart we also examine inequalities for a(n) and provide upper bound for it in the fashion of the classic partition function p(n).

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…

In submodular $k$-partition, the input is a non-negative submodular function $f$ defined over a finite ground set $V$ (given by an evaluation oracle) along with a positive integer $k$ and the goal is to find a partition of the ground set…