English
Related papers

Related papers: Generating function for K-restricted jagged partit…

200 papers

For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…

Number Theory · Mathematics 2025-08-19 Rinchin Drema , Nipen Saikia

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

Combinatorics · Mathematics 2010-10-14 William J. Keith

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

Number Theory · Mathematics 2018-04-11 Heng Huat Chan , Liuquan Wang

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

Combinatorics · Mathematics 2018-12-05 Yuriy Choliy , Andrew V. Sills

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

Number Theory · Mathematics 2019-09-11 Yuchen Ding , Yu-Chen Sun

There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…

Combinatorics · Mathematics 2024-07-04 David J. Hemmer , Karlee J. Westrem

Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and…

Combinatorics · Mathematics 2026-05-07 Robert X. J. Hao , Xiaorui Niu , Doris D. M. Sang , Diane Y. H. Shi

We prove a theorem which add a new member to Rogers-Ramanujan identities. This new member counts partitions with different type of constraints on even and odd parts. Generalizing this theorem, we obtain two family of partition identities of…

Algebraic Geometry · Mathematics 2021-11-11 Pooneh Afsharijoo

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…

Combinatorics · Mathematics 2025-12-02 Mircea Merca

By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…

Number Theory · Mathematics 2017-02-10 Chris Jennings-Shaffer

The study of flattened partitions is an active area of current research. In this paper, our study unexpectedly leads us to the OEIS numbers A124324. We provide a new combinatorial interpretation of these numbers. A combinatorial bijection…

Combinatorics · Mathematics 2020-07-09 O. Nabawanda , F. Rakotondrajao , A. S. Bamunoba

We show that while the number of coprime compositions of a positive integer $n$ into $k$ parts can be expressed as a $\mathbb{Q}$-linear combinations of the Jordan totient functions, this is never possible for the coprime partitions of $n$…

Number Theory · Mathematics 2021-01-19 Daniela Bubboloni , Florian Luca

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

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

Combinatorics · Mathematics 2007-05-23 William M. Y. Goh , Pawel Hitczenko , Ali Shokoufandeh

A Heegaard splitting which admits a unique pair of disjoint compression disks on distinct sides is said to be keen weakly reducible. This paper provides an construction of keen weakly reducible Heegaard splittings of arbitrary genus except…

Geometric Topology · Mathematics 2017-03-07 Qiang E

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. We prove that, if a determinant $\Delta_{r,D}$, which depends only on $r$ and $D$, with…

Number Theory · Mathematics 2024-05-01 Mircea Cimpoeas

We consider some $q$-series which depend on a pair of positive integers $(k,m)$. While positivity of these series holds for the first few values of $(k,m)$, the situation is quite unclear for other values of $(k,m)$. In addition, our series…

Number Theory · Mathematics 2025-07-15 George E. Andrews , Mohamed El Bachraoui

The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…

Combinatorics · Mathematics 2023-05-04 Jean-Bernard Zuber

The simplest partition function, associated with homogeneous symmetric forms S of degree r in n variables, is integral discriminant J_{n|r}(S) = \int e^{-S(x_1 ... x_n)} dx_1 ... dx_n. Actually, S-dependence remains the same if e^{-S} in…

Mathematical Physics · Physics 2009-12-07 A. Morozov , Sh. Shakirov

Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…

Combinatorics · Mathematics 2020-07-03 Çağın Ararat , Ülkü Gürler , M. Emrullah Ildız