English
Related papers

Related papers: Some Families of Identities for Integer Partition …

200 papers

We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…

Combinatorics · Mathematics 2020-04-14 Kağan Kurşungöz

Let $p_2(n)$ denote the number of cubic partitions. In this paper, we shall present two new congruences modulo $11$ for $p_2(n)$. We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will…

Number Theory · Mathematics 2017-02-14 Shane Chern , Manosij Ghosh Dastidar

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

For any positive integers $n$ and $r$, let $p_r(n)$ denotes the number of partitions of $n$ where each part has $r$ distinct colours. Many authors studied the partition function $p_r(n)$ for particular values of $r$. In this paper, we prove…

Number Theory · Mathematics 2020-08-17 Nipen Saikia , Chayanika Boruah

Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…

Number Theory · Mathematics 2022-06-22 Madeline Locus , Ian Wagner

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

Combinatorics · Mathematics 2007-05-23 K. Alladi , A. Berkovich

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…

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

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using theta function identities due to Ramanujan, we establish some new infinite…

Number Theory · Mathematics 2019-07-23 S. Abinash , T. Kathiravan , K. Srilakshmi

Resorting to the recursions satisfied by the polynomials which converge to the right hand sides of the Rogers-Ramanujan type identities given by Sills and a determinant method presented in a paper by Ismail-Prodinger-Stanton, we obtain many…

Combinatorics · Mathematics 2009-07-01 N. S. S. Gu , H. Prodinger

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Combinatorics · Mathematics 2024-03-26 Rajat Gupta , Noah Lebowitz-Lockard

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Combinatorics · Mathematics 2012-07-16 Noga Alon

Relations involving the Rogers-Ramanujan continued fractions $R(q),$ $R(q^3 ),$ and $R(q^4)$ are used to find new generating functions and congruences modulo 5 and 25 for 3-core, 4-core, 4-regular, and colored partition functions.

Number Theory · Mathematics 2020-05-15 Nayandeep Deka Baruah , Nilufar Mana Begum , Hirakjyoti Das

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Nuclear Theory · Physics 2009-11-07 Pierre Desesquelles

We give simple elementary proofs of Bressoud's and Schur's polynomial versions of the Rogers-Ramanujan identities

Combinatorics · Mathematics 2007-05-23 Johann Cigler

The famous Rogers-Ramanujan and Andrews--Gordon identities are embedded in a doubly-infinite family of Rogers-Ramanujan-type identities labelled by positive integers m and n. For fixed m and n the product side corresponds to a specialised…

Combinatorics · Mathematics 2013-11-06 S. Ole Warnaar

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

Number Theory · Mathematics 2019-07-17 Erin Bevilacqua , Kapil Chandran , Yunseo Choi

In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…

Combinatorics · Mathematics 2013-12-17 Colin Sandon , Fabrizio Zanello

A proof of the first Rogers-Ramanujan identity is given using admissible neighborly partitions. This completes a program initiated by Mohsen and Mourtada. The admissible neighborly partitions involve an unusual mod 3 condition on the parts.

Combinatorics · Mathematics 2023-07-14 Kathleen O'Hara , Dennis Stanton

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…

Combinatorics · Mathematics 2017-03-16 Shashank Kanade , Matthew C. Russell

Inspired by a number of recent papers by Corteel, Dousse, Foda, Uncu and Welsh on cylindric partitions and Rogers-Ramanujan-type identities, we obtain the $\mathrm{A}_2$ (or $\mathrm{A}_2^{(1)}$) analogues of the celebrated Andrews-Gordon…

Combinatorics · Mathematics 2023-07-04 S. Ole Warnaar
‹ Prev 1 8 9 10 Next ›