English
Related papers

Related papers: A note on Andrews-MacMahon theorem

200 papers

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

Combinatorics · Mathematics 2015-08-26 Andrew Timothy Wilson

In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…

Combinatorics · Mathematics 2022-07-11 Jiyou Li , Sicheng Zhao

We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

Combinatorics · Mathematics 2022-10-17 Hunter Waldron

In a series of papers, George Andrews and various coauthors successfully revitalized seemingly forgotten, powerful machinery based on MacMahon's $\Omega$ operator to systematically compute generating functions $\sum_{\la \in P}…

Number Theory · Mathematics 2013-10-07 Matthias Beck , Benjamin Braun , Nguyen Le

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

Number Theory · Mathematics 2021-08-31 Abdulaziz M. Alanazi , Darlison Nyirenda

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

Combinatorics · Mathematics 2022-04-05 James A. Sellers , Fabrizio Zanello

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Combinatorics · Mathematics 2024-05-30 James A. Sellers

Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of…

Number Theory · Mathematics 2015-11-04 Liuquan Wang

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…

Combinatorics · Mathematics 2025-09-01 Dandan Chen , Ziyin Zou

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

Combinatorics · Mathematics 2023-10-30 Y. H. Chen , Thomas Y. He , F. Tang , J. J. Wei

Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that…

Quantum Algebra · Mathematics 2024-02-13 Shunsuke Tsuchioka , Masaki Watanabe

For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressoud's bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We…

Combinatorics · Mathematics 2018-03-30 John Murray

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…

Combinatorics · Mathematics 2022-02-08 Shishuo Fu

For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…

Combinatorics · Mathematics 2023-10-31 Darlison Nyirenda , Molatelo Rapudi

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.

Combinatorics · Mathematics 2020-05-18 XinHua Xiong , William J. Keith

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

Combinatorics · Mathematics 2020-02-20 Jia Huang

In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of…

Combinatorics · Mathematics 2018-01-08 Doris D. M. Sang , Diane Y. H. Shi

In this note, we provide three new, very short proofs of two interesting congruences for Merca's partition function $a(n)$, which enumerates integer partitions where the odd parts have multiplicity at most 2. These modulo 2 congruences were…

Combinatorics · Mathematics 2025-12-18 Fabrizio Zanello

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

We give a commutative algebra viewpoint on Andrews recursive formula for the partitions appearing in "Gordon's identities", which are a generalization of Rogers-Ramanujan identities. Using this approach and differential ideals we conjecture…

Algebraic Geometry · Mathematics 2021-11-11 Pooneh Afsharijoo