中文
相关论文

相关论文: The Bressoud-G\"ollnitz-Gordon Theorem for Overpar…

200 篇论文

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…

组合数学 · 数学 2018-03-19 Thomas Y. He , Kathy Q. Ji , Allison Y. F. Wang , Alice X. H. Zhao

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

Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that…

组合数学 · 数学 2014-02-26 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

A Goellnitz-Gordon partition is one in which the parts differ by at least 2, and where the inequality is strict if a part is even. Let Q_i(n) denote the number of partitions of n into distinct parts not congruent to i mod 4. By attaching…

组合数学 · 数学 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

组合数学 · 数学 2024-07-01 Thomas Y. He , C. S. Huang , H. X. Li , X. Zhang

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

组合数学 · 数学 2020-05-19 Xinhua Xiong , William J. Keith

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

组合数学 · 数学 2026-03-16 D. S. Gireesh , B. Hemanthkumar

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

We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.

组合数学 · 数学 2020-05-18 XinHua Xiong , William J. Keith

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$. In this paper, we introduce a new partition function $\overline{B}_0$ which can be viewed as an overpartition analogue of the partition function $B_0$. An…

组合数学 · 数学 2023-12-04 Y. H. Chen , T. T. Gu , Thomas Y. He , F. Tang , J. J. Wei

We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…

数论 · 数学 2013-11-22 Kathrin Bringmann , Jeremy Lovejoy , Karl Mahlburg

We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and…

组合数学 · 数学 2016-07-01 Jehanne Dousse

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

The Alladi-Gordon identity plays an important role for the Alladi-Gordon generalization of Schur's partition theorem. By using Joichi-Stanton's insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key…

组合数学 · 数学 2012-02-07 James J. Y. Zhao

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

组合数学 · 数学 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong

In a recent work, Andrews defined the singular overpartitions with the goal of presenting an overpartition analogue to the theorems of Rogers--Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his…

组合数学 · 数学 2017-12-27 Doris D. M. Sang , Diane Y. H. Shi

The $(k,i)$-singular overpartitions, combinatorial objects introduced by Andrews in 2015, are known to satisfy Ramanujan-type congruences modulo any power of prime coprime to $6k$. In this paper we consider the parity of the number…

数论 · 数学 2023-12-05 Victor Manuel Aricheta , Jerome Dimabayao , Hazel Joy Shi

In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…

数论 · 数学 2024-05-31 Shi-Chao Chen , Michael D. Hirschhorn , James A. Sellers

A notion of generalized $n$-semimodularity is introduced, which extends that of (sub/super)mod\-ularity in four ways at once. The main result of this paper, stating that every generalized $(n\colon\!2)$-semimodular function on the $n$th…

概率论 · 数学 2019-02-15 Iosif Pinelis

In 2014, as part of a larger study of overpartitions with restrictions of the overlined parts based on residue classes, Munagi and Sellers defined $d_2(n)$ as the number of overpartitions of weight $n$ wherein only even parts can be…

组合数学 · 数学 2024-12-25 Aidan Carlson , Brian Hopkins , James A. Sellers
‹ 上一页 1 2 3 10 下一页 ›