English
Related papers

Related papers: Perfect Overpartitions and Factorization of Intege…

200 papers

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…

Combinatorics · Mathematics 2007-06-18 Alexander E. Holroyd

In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied…

Combinatorics · Mathematics 2026-04-15 Subhash Chand Bhoria , Pramod Eyyunni , Subhrangsu Santra

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

Combinatorics · Mathematics 2007-05-23 Edwin O'Shea

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Combinatorics · Mathematics 2007-11-07 Jean-Christophe Aval

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Combinatorics · Mathematics 2026-03-16 D. S. Gireesh , B. Hemanthkumar

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…

Number Theory · Mathematics 2014-07-04 Jose Arnaldo B. Dris

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

Combinatorics · Mathematics 2025-08-26 Vladimir Gurvich , Mariya Naumova

If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…

Combinatorics · Mathematics 2013-04-25 Peter Borg

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

Combinatorics · Mathematics 2022-05-24 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…

Combinatorics · Mathematics 2024-08-02 Christian Hercher , Frank Niedermeyer

This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…

Metric Geometry · Mathematics 2015-08-05 Joel A. Tropp

Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…

Combinatorics · Mathematics 2026-03-31 Amita Malik , Rishabh Sarma

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

Number Theory · Mathematics 2023-03-20 Colin Alberts , Olivia Beckwith , Irfan Demetoglu , Robert Dicks , John H. Smith , Jasmine Wang

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Number Theory · Mathematics 2019-01-09 James Mc Laughlin

Andrews introduced the partition function $\overline{C}_{k, i}(n)$, called singular overpartition, which counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined.…

Number Theory · Mathematics 2023-03-10 Chiranjit Ray

In this paper, we study the partition functions $\overline{R_\ell^\ast}(n)$, which count the number of overpartitions of $n$ where the non-overlined parts are $\ell$-regular for a given $\ell$. Using elementary techniques, as well as the…

Number Theory · Mathematics 2025-06-10 Hemjyoti Nath , Manjil P. Saikia , James A. Sellers

A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…

Number Theory · Mathematics 2023-11-28 Sai Teja Somu , Andrzej Kukla , Duc Van Khanh Tran

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…

Combinatorics · Mathematics 2023-10-30 Y. H. Chen , Thomas Y. He , F. Tang , J. J. Wei

The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…

Number Theory · Mathematics 2023-09-04 Qi-Yang Zheng

Alanzi et al. (2022) investigated overpartition of a positive integer $n$ with $\ell$-regular non-overlined parts denoted by $\overline R_\ell^\ast (n)$, and proved some results for the case $\ell=3$. As extension to the results of Alanzi…

Number Theory · Mathematics 2025-03-26 Nipen Saikia , Adam Paksok