中文
相关论文

相关论文: Beck-type identities: new combinatorial proofs and…

200 篇论文

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

组合数学 · 数学 2018-07-02 Cristina Ballantine , Richard Bielak

Partition identities are often statements asserting that the set $\mathcal P_X$ of partitions of $n$ subject to condition $X$ is equinumerous to the set $\mathcal P_Y$ of partitions of $n$ subject to condition $Y$. A Beck-type identity is a…

数论 · 数学 2020-09-17 Cristina Ballantine , Amanda Welch

Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…

Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement…

组合数学 · 数学 2022-04-04 Tewodros Amdeberhan , George E. Andrews , Cristina Ballantine

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

组合数学 · 数学 2026-02-03 Nayandeep Deka Baruah , Haijun Li , Pankaj Jyoti Mahanta

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

组合数学 · 数学 2018-10-09 Jane Y. X. Yang

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

组合数学 · 数学 2023-05-11 Faye Jackson , Misheel Otgonbayar

The original Beck conjecture, now a theorem due to Andrews, states that the difference in the number of parts in all partitions into odd parts and the number of parts in all strict partitions is equal to the number of partitions whose set…

组合数学 · 数学 2021-01-21 Cristina Ballantine , Amanda Welch

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

组合数学 · 数学 2025-05-15 Dandan Chen , Rong Chen , Mengjie Zhao

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

组合数学 · 数学 2025-09-01 Dandan Chen , Ziyin Zou

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

组合数学 · 数学 2010-10-14 William J. Keith

Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…

Beck introduced two partition statistics $NT(r,m,n)$ and $M_{\omega}(r,m,n)$,which denote the total number of parts in the partition of $n$ with rank congruent to $r$ modulo $m$ and the total number of ones in the partition of $n$ with…

数论 · 数学 2023-07-20 Renrong Mao , Ernest X. W. Xia

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

组合数学 · 数学 2012-03-21 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

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

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

组合数学 · 数学 2026-03-12 Haijun Li

In this paper, we prove a theorem which adds a new member to the famous G\"oellnitz-Gordon identities. We construct a "new system of recurrence formulas" in order to prove it.

组合数学 · 数学 2024-03-18 Pooneh Afsharijoo

In this paper we give an analytic proof of the identity $A_{5,3,3}(n) =B^0_{5,3,3}(n)$, where $A_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain restrictions on their parts, and $B^0_{5,3,3}(n)$ counts the number of…

组合数学 · 数学 2008-02-12 Padmavathamma , B. M. Chandrashekara , R. Raghavendra , C. Krattenthaler

For any integer $k\geq2$, we prove combinatorially the following Euler (binomial) transformation identity $$ \NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t), $$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the sum of…

组合数学 · 数学 2019-09-17 Zhicong Lin , Dongsu Kim

Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…

组合数学 · 数学 2025-06-18 Haijun Li
‹ 上一页 1 2 3 10 下一页 ›