English
Related papers

Related papers: Goellnitz-Gordon partitions with weights and parit…

200 papers

We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\phi_1 \rightarrow {}_2\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions,…

Number Theory · Mathematics 2016-11-15 Alexander Berkovich , Ali Kemal Uncu

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 prove a new four parameter q-hypergeometric series identity from which the three parameter key identity for the Goellnitz theorem due to Alladi, Andrews, and Gordon, follows as a special case by setting one of the parameters equal to 0.…

Combinatorics · Mathematics 2009-11-07 Krishnaswami Alladi , George E. Andrews , Alexander Berkovich

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

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 this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Combinatorics · Mathematics 2020-05-08 Mircea Merca

The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…

Let p(n) denote the number of unrestricted partitions of n. For i=0, 2, let p[i](n) denote the number of partitions pi of n such that O(pi) - O(pi') = i mod 4. Here O(pi) denotes the number of odd parts of the partition pi and pi' is the…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

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…

Combinatorics · Mathematics 2012-02-07 James J. Y. Zhao

The partition function $pod(n)$ enumerates the partitions of $n$ wherein odd parts are distinct and even parts are unrestricted. Recently, a number of properties for $pod(n)$ have been established. In this paper, for $k\in\{0,2\}$ we…

Combinatorics · Mathematics 2022-10-26 Cristina Ballantine , Mircea Merca

A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…

Number Theory · Mathematics 2007-05-23 Dohoon Choi , Soon-Yi Kang , Jeremy Lovejoy

In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…

Number Theory · Mathematics 2024-07-16 Hemjyoti Nath

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

Combinatorics · Mathematics 2022-05-13 Damanvir Singh Binner

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

Probability · Mathematics 2016-08-09 Ljuben Mutafchiev

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…

Number Theory · Mathematics 2023-03-07 Cristina Ballantine , Amanda Folsom

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

Number Theory · Mathematics 2025-06-11 Shishuo Fu , Dazhao Tang

We construct Andrews-Gordon type evidently positive series as generating functions for the partitions satisfying the difference conditions imposed by Capparelli's identities and G\"{o}llnitz-Gordon identities. The construction involves…

Combinatorics · Mathematics 2018-07-31 Kağan Kurşungöz

It is well known that the number of partitions into distinct even parts equals the number of $4$-regular partitions. In this paper we prove identities relating certain restricted partitions into distinct even parts with restricted…

Combinatorics · Mathematics 2024-10-04 George E. Andrews , Mohamed El Bachraoui

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

Combinatorics · Mathematics 2010-06-29 William Y. C. Chen , Kathy Q. Ji , Albert J. W. Zhu

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Combinatorics · Mathematics 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello