English
Related papers

Related papers: A Four-parameter Partition Identity

200 papers

In a work of 1995, Alladi, Andrews, and Gordon provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the…

Number Theory · Mathematics 2020-04-07 Stefano Capparelli , Alberto Del Fra , Pietro Mercuri , Andrea Vietri

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

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…

In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…

Number Theory · Mathematics 2023-10-23 Mircea Merca , Maxie D. Schmidt

We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…

Combinatorics · Mathematics 2007-05-23 George E. Andrews , Rodrigo Alonso Perez

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

Combinatorics · Mathematics 2025-05-28 Shishuo Fu , James Sellers

We announce a new four parameter partition theorem from which the (big) theorem of Gollnitz follows by setting any one of the parameters equal to 0. This settles a problem of Andrews who asked whether there exists a result that goes beyond…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , George E. Andrews , Alexander Berkovich

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

Combinatorics · Mathematics 2024-06-04 Cristina Ballantine , Amanda Welch

We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…

Combinatorics · Mathematics 2019-02-21 Kağan Kurşungöz

We obtain a finite form of Jacobi's identity and present a combinatorial proof based on the structure of synchronized partitions.

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Kathy Q. Ji

Recently, Andrews and Merca have given a new combinatorial interpretation of the total number of even parts in all partitions of n into distinct parts. We generalise this result and consider many more variations of their work. We also…

Combinatorics · Mathematics 2022-11-28 Darlison Nyirenda , Beaullah Mugwangwavari

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

Number Theory · Mathematics 2020-02-19 Chiranjit Ray , Rupam Barman

New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.

Number Theory · Mathematics 2007-05-23 A. O. L. Atkin , F. G. Garvan

The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…

Combinatorics · Mathematics 2015-05-04 Felix Breuer , Brandt Kronholm

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…

Number Theory · Mathematics 2024-05-31 Shi-Chao Chen , Michael D. Hirschhorn , James A. Sellers

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Number Theory · Mathematics 2025-09-29 A. David Christopher

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…

Number Theory · Mathematics 2024-10-24 Gabriel Gray , David Hovey , Brandt Kronholm , Emily Payne , Holly Swisher , Ren Watson

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

Combinatorics · Mathematics 2025-07-21 Eli R. DeWitt , William J. Keith

In this paper, we prove some new \(q\)-series identities connecting \(4\)-regular partitions and partitions with distinct even parts with largest part being odd. We also define three new partition functions with distinct even parts except…

Number Theory · Mathematics 2026-02-18 Gaurab Bardhan , Nipen Saikia

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…

Combinatorics · Mathematics 2025-05-15 Dandan Chen , Rong Chen , Mengjie Zhao