activity
20162024
most citedOverpartitions and Bressoud's conjecture, II

1 citations · 2 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2024

A bijection related to Bressoud's conjecture

Y. H. Chen, Thomas Y. He

Bressoud introduced the partition function , which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the…

math.CO2023

An overpartition analogue of Bressoud conjecture for even moduli

Y. H. Chen, T. T. Gu, Thomas Y. He +2

In 1980, Bressoud conjectured a combinatorial identity for or . In this paper, we introduce a new partition function which can be viewed as an o…

math.CO2023★ 1 cited

Some Separable integer partition classes

Y. H. Chen, Thomas Y. He, F. Tang +1

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity intr…

math.CO2022

New companions to the generations of the Göllnitz-Gordon identities

Thomas Y. He, Alice X. H. Zhao

The Göllnitz-Gordon identities were found by Göllnitz and Gordon independently. In 1967, Andrews obtained a combinatorial generalization of the Göllnitz-Gordon identities, called t…

math.CO2020★ 1 cited

Overpartitions and Bressoud's conjecture, II

Thomas Y. He, Kathy Q. Ji, Alice X. H. Zhao

The main objective of this paper is to present an answer to Bressoud's conjecture for the case , resulting in a complete solution to the conjecture. The case for has bee…

math.CO2019

Overpartitions and Bressoud's conjecture, I

Thomas Y. He, Kathy Q. Ji, Alice X. H. Zhao

In 1980, Bressoud conjectured a combinatorial identity for or , where the function counts the number of partitions with certain congruence conditions and t…

math.CO2017

The Bressoud-Göllnitz-Gordon Theorem for Overpartitions of even moduli

Thomas Y. He, Allison Y. F. Wang, Alice X. H. Zhao

We give an overpartition analogue of Bressoud's combinatorial generalization of the Göllnitz-Gordon theorem for even moduli in general case. Let be the num…

math.CO2016

An overpartition analogue of the Andrews-Göllnitz-Gordon theorem

Thomas Y. He, Kathy Q. Ji, Allison Y. F. Wang +1

In 1967, Andrews found a combinatorial generalization of the Göllnitz-Gordon theorem, which can be called the Andrews-Göllnitz-Gordon theorem. In 1980, Bressoud derived a multisum…