English
Related papers

Related papers: Bressoud-Subbarao type weighted partition identiti…

200 papers

We provide a refined combinatorial identity for the set of partitions of $\{1,\dots, n\}$, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free…

Probability · Mathematics 2024-08-02 Octavio Arizmendi , Katsunori Fujie , Yuki Ueda

In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…

Combinatorics · Mathematics 2023-01-31 Mirko Primc

Many classical $q$-series identities, such as the Rogers--Ramanujan identities, yield combinatorial interpretations in terms of integer partitions. Here we consider algebraically manipulating some of the classical $q$-series to yield…

Combinatorics · Mathematics 2025-02-03 Abdulaziz Alanazi , Augustine O. Munagi , Andrew V. Sills

Extending Sellers' result, Das et al. recently proved some congruence results for generalized overcubic partitions using theta functions and posed some related conjectures. In this paper, we provide a combinatorial proof of a result in…

Number Theory · Mathematics 2025-12-05 Suparno Ghoshal , Arijit Jana

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

General Mathematics · Mathematics 2022-12-20 M. J. Kronenburg

We give a combinatorial proof that Postnikov and Stanley's formula for dual Schubert polynomials in terms of weighted chains in Bruhat order is equivalent to a classical Cauchy identity for polynomials. This gives a natural interpretation…

Combinatorics · Mathematics 2023-12-01 Zachary Hamaker

Let $p(n)$ be the number of partition of a positive integer $n$. We derive a new identity for complete Bell polynomials based on a generating function of $p(7n+5)$ given by Ramanujan.

Combinatorics · Mathematics 2018-09-13 Ho-Hon Leung

A generalized Bailey pair, which contains several special cases considered by Bailey (\emph{Proc. London Math. Soc. (2)}, 50 (1949), 421--435), is derived and used to find a number of new Rogers-Ramanujan type identities. Consideration of…

Combinatorics · Mathematics 2018-11-29 Andrew V. Sills

We study a generalized class of weighted $k$-regular partitions defined by \[ \sum_{n=0}^{\infty} c_{k, r_1, r_2}(n) q^n = \prod_{n=1}^{\infty} \frac{(1 - q^{nk})^{r_1}}{(1 - q^n)^{r_2}}, \] which extends the classical $k$-regular partition…

Number Theory · Mathematics 2025-12-05 Debika Banerjee , Ben Kane

In this article, a $q$-series examined by Kluyver and Uchimura is generalized. This allows us to find generalization of the identities in the random acyclic digraph studied by Simon, Crippa, and Collenberg in 1993. As one of the corollaries…

Number Theory · Mathematics 2020-12-22 Rajat Gupta , Rahul Kumar

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

Recently Corteel and Welsh outlined a technique for finding new sum-product identities by using functional relations between generating functions for cylindric partitions and a theorem of Borodin. Here, we extend this framework to include…

Combinatorics · Mathematics 2022-01-11 Walter Bridges , Ali Uncu

We present what we call a "motivated proof" of the Bressoud-G\"ollnitz-Gordon partition identities. Similar "motivated proofs" have been given by Andrews and Baxter for the Rogers-Ramanujan identities and by Lepowsky and Zhu for Gordon's…

Combinatorics · Mathematics 2023-11-06 John Layne , Samuel Marshall , Christopher Sadowski , Emily Shambaugh

We derive two general transformations for certain basic hypergeometric series from the recurrence formulae for the partial numerators and denominators of two $q$-continued fractions previously investigated by the authors. By then…

Number Theory · Mathematics 2019-01-18 Douglas Bowman , James Mc Laughlin , Nancy J. Wyshinski

The Rogers-Ramanujan identities and various analogous identities (Gordon, Andrews-Bressoud, Capparelli, etc.) form a family of very deep identities concerned with integer partitions. These identities (written in generating function form)…

Combinatorics · Mathematics 2014-11-20 Shashank Kanade , Matthew C. Russell

The restricted partitions in which the largest part is less than or equal to $N$ and the number of parts is less than or equal to $k$ were investigated by Andrews in \cite{Andrews76}. These partitions were extended recently by the author to…

Combinatorics · Mathematics 2020-06-02 Mircea Merca

We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…

Combinatorics · Mathematics 2021-05-19 Eric M. Rains , S. Ole Warnaar

We study the Andrews-Gordon-Bressoud (AGB) generalisations of the Rogers-Ramanujan q-series identities in the context of cylindric partitions. We recall the definition of r-cylindric partitions, and provide a simple proof of Borodin's…

Mathematical Physics · Physics 2017-06-05 O. Foda , T. A. Welsh

We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow…

Number Theory · Mathematics 2019-02-18 Alexander Berkovich , Ali K. Uncu

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…

Information Theory · Computer Science 2010-11-23 G. David Forney
‹ Prev 1 4 5 6 7 8 10 Next ›