中文
相关论文

相关论文: Polynomization of the Liu-Zhang inequality for ove…

200 篇论文

Let A and M be nonempty sets of positive integers. A partition of the positive integer n with parts in A and multiplicities in M is a representation of n in the form n = \sum_{a\in A} m_a a, where m_a is in M U {0} for all a in A, and m_a…

数论 · 数学 2013-04-15 Zeljka Ljujic , Melvyn B. Nathanson

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of $q$-ary $\overline{2}$-separable codes that improves recent results of Wang for any $q\geq 13$. For the case $q=2$, we recover…

组合数学 · 数学 2021-06-25 Stefano Della Fiore , Marco Dalai

In 2011, Neil Hindman proved that for every natural number $n,m$ the polynomial \begin{equation*} \sum_{i=1}^{n} x_{i}-\prod\limits_{j=1}^{m} y_{j} \end{equation*} has monochromatic solutions for every finite coloration of $\mathbb{N}$. We…

逻辑 · 数学 2013-12-13 Lorenzo Luperi Baglini

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…

组合数学 · 数学 2022-05-10 Thomas Y. He , Kathy Q. Ji , Alice X. H. Zhao

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

组合数学 · 数学 2010-02-09 Jerome Kelleher

Very recently, Thejitha, Sellers, and Fathima defined the function $a_{r,s}(n)$, which enumerates the number of multicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors,…

组合数学 · 数学 2026-03-11 M. P. Thejitha , S. N. Fathima

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

组合数学 · 数学 2015-12-15 Clifford Smyth

We prove an interpolation result for homogeneous polynomials over the integers, or more generally for PIDs with finite residue fields. Previous proofs of this result use the well-known but nontrivial fact that class groups of rings of…

交换代数 · 数学 2020-09-24 John Berman , Daniel Erman

Wu, Lou, Lai and Chang proposed a multi-exponentiation algorithm using binary complements and the non-adjacent form. The purpose of this paper is to show that neither the analysis of the algorithm given by its original proposers nor that by…

组合数学 · 数学 2011-08-31 Clemens Heuberger , Helmut Prodinger

In the paper, we investigate the uniqueness problem of entire functions concerning their linear differential polynomial in shift and obtain three results which improve and generalize the recent result due to Qi (Ann. Polon. Math., 102…

复变函数 · 数学 2025-12-03 Jeet Sarkar , Debabrata Pramanik

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

组合数学 · 数学 2018-12-05 Yuriy Choliy , Andrew V. Sills

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} (\bmod p^{r}),…

数论 · 数学 2015-03-12 Zhongyan Shen , Tianxin Cai

A sequence of $\{a_n\}_{n\ge 0}$ satisfies the Briggs inequality if \begin{align*} a_n^2(a_n^2-a_{n-1}a_{n+1})>a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{align*} holds for any $n\ge 1$. In this paper we show that both the partition function…

组合数学 · 数学 2024-08-30 Xin-Bei Liu , Zhong-Xue Zhang

A new bi-parametric $su(1,1)$ algebraization of the Heun class of equations is explored. This yields additional quasi-polynomial solutions of the form $\{z^{\alpha}P_N(z): \ \alpha \in \mathbb{C}, \ N \in \mathbb{N}_0\}$ to the General Heun…

数学物理 · 物理学 2020-08-11 Priyasri Kar

We investigate the diagonal generating function of the Jacobi-Stirling numbers of the second kind $ \JS(n+k,n;z)$ by generalizing the analogous results for the Stirling and Legendre-Stirling numbers. More precisely, letting…

组合数学 · 数学 2012-06-25 Ira M. Gessel , Zhicong Lin , Jiang Zeng

We prove effective finiteness results concerning polynomial values of the sums $$ b^k +\left(a+b\right)^k + \cdots + \left(a\left(x-1\right) + b\right)^k $$ and $$ b^k - \left(a+b\right)^k + \left(2a+b\right)^k - \ldots + (-1)^{x-1}…

数论 · 数学 2024-04-26 András Bazsó

Two new expansions for partial sums of Gauss' triangular and square numbers series are given. As a consequence, we derive a family of inequalities for the overpartition function $\bar{p}(n)$ and for the partition function $p_1(n)$ counting…

组合数学 · 数学 2013-01-15 Victor J. W. Guo , Jiang Zeng

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

数论 · 数学 2026-05-21 M. P. Thejitha , S. N. Fathima

In a recent paper, Jin, Liu, and Xia \cite{JLX} presented some modulo 4 congruences for $\overline{spt2}(n)$, the number of smallest parts in the overpartitions of $n$ where the smallest part is even and is not overlined. In this paper, we…

数论 · 数学 2025-10-27 Robson da Silva

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

数论 · 数学 2018-04-05 Kevin Chen , Jianqiang Zhao