中文
相关论文

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

200 篇论文

For integers $k,t \geq 2$ and $1\leq r \leq t$ let $D_k(r,t;n)$ be the number of parts among all $k$-regular partitions (i.e., partitions of $n$ where all parts have multiplicity less than $k$) of $n$ that are congruent to $r$ modulo $t$.…

组合数学 · 数学 2022-07-12 Faye Jackson , Misheel Otgonbayar

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

数论 · 数学 2024-05-10 Dalen Dockery , Marie Jameson , James A. Sellers , Samuel Wilson

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 this note, we will give proofs of two congruences involving broken 3-diamond partitions and broken 5-diamond partitions which were conjectured by Peter Paule and Silviu Radu.

数论 · 数学 2010-06-17 Xinhua Xiong

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

We establish the asymptotic behavior of the Andrews $G_k(q)$ function as $q\to 1.$

数论 · 数学 2017-05-16 Kathrin Bringmann , Robert Rhoades , Daniel Parry

We prove an asymptotic formula for the number of $d$-fold partition diamonds of $n$ and their Schmidt-type counterparts. In order to do so, we study the asymptotic behavior of certain infinite products. We also remark on interesting…

数论 · 数学 2023-11-29 Kathrin Bringmann , William Craig , Joshua Males

In this paper, we obtain asymptotic formulas for $k$-crank of $k$-colored partitions. Let $M_k(a, c; n)$ denote the number of $k$-colored partitions of $n$ with a $k$-crank congruent to $a$ mod $c$. For the cases $k=2,3,4$, Fu and Tang…

组合数学 · 数学 2023-04-14 Helen W. J. Zhang , Ying Zhong

A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are…

数论 · 数学 2014-01-14 Greg Martin , Scott Sitar

We prove new formulas for $\operatorname{DD}_k(n)$, the number of plane partition diamonds of length $k$ of $n$, and, also, for its polynomial part.

组合数学 · 数学 2024-02-09 Mircea Cimpoeas , Alexandra Teodor

We aim to introduce a $\mathtt{k}$-Struve function and investigate its various properties, including mainly certain inequalities associated this function. One of the inequalities given here is pointed out to be related to the so-called…

经典分析与常微分方程 · 数学 2016-11-29 Kottakkaran Sooppy Nisar , Saiful Rahman Mondal , Junesang Choi

Inspired by the work of C. Mortici [1] and A. Laforgia et. al [2] we have established some new Tur\'an-type inequalities for k-polygamma function and p-k-polygamma function.

经典分析与常微分方程 · 数学 2022-07-04 Omprakash Atale

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

数据结构与算法 · 计算机科学 2018-01-22 Joergen Bang-Jensen , Stéphane Bessy

We derive an asymptotic formula for the divisor function $\tau(k)$ in an arithmetic progression $k\equiv a(\bmod \ q)$, uniformly for $q\leq X^{\Delta_{n,l}}$ with $(q,a)=1$. The parameter $\Delta_{n,l}$ is defined as $$…

数论 · 数学 2025-05-27 Mingxuan Zhong , Tianping Zhang

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

组合数学 · 数学 2025-09-30 Faye Jackson , Misheel Otgonbayar

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

组合数学 · 数学 2025-12-25 Gargi Mukherjee , Helen W. J. Zhang , Ying Zhong

Let $j,n$ be even positive integers, and let $\overline{p}_j(n)$ denote the number of partitions with BG-rank $j$, and $\overline{p}_j(a,b;n)$ to be the number of partitions with BG-rank $j$ and $2$-quotient rank congruent to $a \pmod{b}$.…

数论 · 数学 2022-09-27 Andrew Baker , Joshua Males

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

In this note our aim is to point out that certain inequalities for modified Bessel functions of the first and second kind, deduced recently by Laforgia and Natalini, are in fact equivalent to the corresponding Tur\'an type inequalities for…

经典分析与常微分方程 · 数学 2013-05-06 Árpád Baricz , Saminathan Ponnusamy

For a positive integer $k$, let \[ \sigma_k(n)=\sum_{d\mid n} d^k \] be the divisor function of order $k$, and let $\nu_p(m)$ denote the $p$-adic valuation of an integer $m$. Motivated by recent work on the $p$-adic valuation of…

数论 · 数学 2026-03-13 Kaimin Cheng , Ke Zhang