中文
相关论文

相关论文: Higher Order Tur\'an Inequalities for the Partitio…

200 篇论文

In 1939 P\'al Tur\'an and J\'anos Er\H{o}d initiated the study of lower estimations of maximum norms of derivatives of polynomials, in terms of the maximum norms of the polynomials themselves, on convex domains of the complex plane. As a…

复变函数 · 数学 2024-07-29 Polina Glazyrina , Szilárd Gy. Révész

Originally, Tur\'{a}n's inequality states that if $(P_n(x))_{n\in\mathbb{N}_0}$ is the sequence of Legendre polynomials, then $\Delta_n(x):=P_n^2(x)-P_{n+1}(x)P_{n-1}(x)\geq0$ for all $n\in\mathbb{N}$ and $x\in[-1,1]$. Gasper specified the…

经典分析与常微分方程 · 数学 2026-05-07 Stefan Kahler

In 1937, Rademacher refined the circle method of Hardy and Ramanujan to derive an exact convergent series for the partition function $p(n)$. In 1942, Hua derived an exact formula for the distinct part partition function, and in 1971, Hagis…

数论 · 数学 2025-11-11 Archit Agarwal , Meghali Garg , Bibekananda Maji

Here we study the roots of the doubly infinite family of Jensen polynomials $J_{\mathrm{PL}}^{d,n}(x)$ associated to MacMahon's plane partition function $\mathrm{PL}(n)$. Recently, Ono, Pujahari, and Rolen proved that $\mathrm{PL}(n)$ is…

数论 · 数学 2022-10-18 Badri Vishal Pandey

Recently, the higher order Tur\'{a}n inequalities for the Boros-Moll sequences $\{d_\ell(m)\}_{\ell=0}^m$ were obtained by Guo. In this paper, we show a different approach to this result. Our proof is based on a criterion derived by Hou and…

组合数学 · 数学 2022-11-04 James Jing Yu Zhao

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…

组合数学 · 数学 2021-10-01 Bernhard Heim , Markus Neuhauser , Robert Tröger

Let $p(n)$ denote the partition function. Desalvo and Pak proved the log-concavity of $p(n)$ for $n>25$ and the inequality $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)>\frac{p(n)}{p(n+1)}$ for $n>1$. Let $r(n)=\sqrt[n]{p(n)/n}$ and…

组合数学 · 数学 2015-11-10 William Y. C. Chen , Ken Y. Zheng

In 1939 P. Tur\'an started to derive lower estimations on the norm of the derivatives of polynomials of (maximum) norm 1 on $I:=[-1,1]$ (interval) and $D:=\{z\in\mathbb{C}~:~|z|\le 1\}$ (disk), under the normalization condition that the…

经典分析与常微分方程 · 数学 2018-05-15 Polina Yu. Glazyrina , Szilárd Gy. Révész

Let $\bar{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic higher order $\log$-concavity property of the overpatition function in a similar framework done by Hou and Zhang for the partition function. This…

数论 · 数学 2022-04-19 Gargi Mukherjee , Helen W. J. Zhang , Ying Zhong

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…

数论 · 数学 2025-04-03 Lukas Mauth

The polynomials $p_n$ orthogonal on the interval $[-1,1],$ normalized by $p_n(1)=1,$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give a general…

经典分析与常微分方程 · 数学 2021-06-29 Ryszard Szwarc

Some 76 years ago P. Tur\'an was the first to establish lower estimations of the ratio of the maximum norm of the derivatives of polynomials and the maximum norm of the polynomials themselves on the interval I:=[-1,1] and on the unit disk…

经典分析与常微分方程 · 数学 2024-07-29 Polina Yu. Glazyrina , Szilárd Gy. Révész

Let $M_0(n)$ (resp. $M_1(n)$) denote the number of partitions of $n$ with even (reps. odd) crank. Choi, Kang and Lovejoy established an asymptotic formula for $M_0(n)-M_1(n)$. By utilizing this formula with the explicit bound, we show that…

组合数学 · 数学 2023-10-31 Janet J. W. Dong , Kathy Q. Ji

In 1939 Tur\'{a}n raised the question about lower estimations of the maximum norm of the derivatives of a polynomial $p$ of maximum norm $1$ on the compact set $K$ of the complex plain under the normalization condition that the zeroes of…

经典分析与常微分方程 · 数学 2023-06-27 P. Yu. Glazyrina , Yu. S. Goryacheva , Sz. Gy. Révész

In this paper, we prove that the number of unimodal sequences of size $n$ is log-concave. These are coefficients of a mixed false modular form and have a Rademacher-type exact formula due to recent work of the second author and Nazaroglu on…

数论 · 数学 2023-07-12 Walter Bridges , Kathrin Bringmann

In this paper, we prove that if $f(x)=\sum_{k=0}^n{n\choose k}a_kx^k$ is a polynomial with real zeros only, then the sequence $\{a_k\}_{k=0}^n$ satisfies the following inequalities $a_{k+1}^2(1-\sqrt{1-c_k})^2/a_k^2…

组合数学 · 数学 2020-12-08 J. J. F Guo

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…

复变函数 · 数学 2016-11-16 Polina Yu. Glazyrina , Szilárd Gy. Révész

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}…

数论 · 数学 2022-01-21 Gargi Mukherjee

In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo--Pak, proved that the partition function $p(n)$ is eventually log-concave. Inspired by this and…

数论 · 数学 2026-05-04 Kathrin Bringmann , Ben Kane , Anubhab Pahari , Larry Rolen

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

经典分析与常微分方程 · 数学 2019-09-24 Tamás Erdélyi