English
Related papers

Related papers: Overpartitions with repeated smallest non-overline…

200 papers

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…

Combinatorics · Mathematics 2022-05-10 Thomas Y. He , Kathy Q. Ji , Alice X. H. Zhao

A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…

Combinatorics · Mathematics 2023-12-29 Sergi Elizalde , Alejandro B. Galván

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

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

Combinatorics · Mathematics 2019-12-23 Andrew V. Sills

Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In…

Combinatorics · Mathematics 2024-10-22 Pankaj Jyoti Mahanta , Manjil P. Saikia

Let $\overline{p}(n)$ be the number of overpartitions of $n$, we establish and give a short elementary proof of the following congruence \[\overline{p}({{4}^{\alpha }}(40n+35))\equiv 0 \, (\bmod \, 40),\] where $\alpha ,n $ are nonnegative…

Number Theory · Mathematics 2014-07-22 Liuquan Wang

In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…

High Energy Physics - Theory · Physics 2007-05-23 Noureddine Chair

Basis partitions are minimal partitions corresponding to successive rank vectors. We show combinatorially how basis partitions can be generated from primary partitions which are equivalent to the Rogers-Ramanujan partitions. This leads to…

Combinatorics · Mathematics 2025-11-21 Krishnaswami Alladi

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Combinatorics · Mathematics 2019-09-04 Jacob Sprittulla

In his important 1920 paper on partitions, MacMahon defined the partition generating functions \begin{align*} A_k(q)=\sum_{n=1}^{\infty}\mathfrak{m}(k;n)q^n&:=\sum_{0< s_1<s_2<\cdots<s_k}…

Combinatorics · Mathematics 2024-05-20 Ken Ono , Ajit Singh

Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…

Number Theory · Mathematics 2025-02-25 Hemanthkumar B. , Sumanth Bharadwaj H. S

This is the sequel exposition following [1]. The framework quotient algebra partition is rephrased in the language of the s-representation. Thanks to this language, a quotient algebra partition of the simplest form is established under a…

Mathematical Physics · Physics 2019-12-10 Zheng-Yao Su

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Combinatorics · Mathematics 2026-04-14 George E. Andrews , Aritram Dhar

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

Combinatorics · Mathematics 2024-06-24 Yen-Chi Roger Lin , Shu-Yen Pan

In this paper, we find an identity which connects the overpartition function and the function of Rogers--Ramanujan--Gordon type overpartitions by considering the weights and gaps. This identity can be seen as an analogue of the weighted…

Combinatorics · Mathematics 2017-04-21 Jeremy J. F. Guo , Doris D. M. Sang , Diane Y. H. Shi

We establish quasimodularity for a family of residual crank generating functions defined on overpartitions. We also show that the second moments of these $k$th residual cranks admit a combinatoric interpretation as weighted overpartition…

Number Theory · Mathematics 2020-05-06 Thomas Morrill , Aleksander Simonič

Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…

This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…

Geometric Topology · Mathematics 2018-09-28 J. Blackman

Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…

Combinatorics · Mathematics 2023-01-27 George E. Andrews , Shane Chern

Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…

Number Theory · Mathematics 2025-05-01 Suparno Ghoshal , Arijit Jana
‹ Prev 1 8 9 10 Next ›