English
Related papers

Related papers: Some Observations on Modulo 5 Congruences for 2-Co…

200 papers

In this paper, we establish two new Ramanujan-type congruences for the overpartition function: $\overline{p}(11\times(8n+5))\equiv 0 \pmod{11}$ and $\overline{p}(13\times 2^6(8n+7))\equiv 0 \pmod{13}$. The proofs rely on the theory of…

Number Theory · Mathematics 2026-03-10 XuanLing Wei

Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Hirschhorn and Sellers showed that $\overline{p}(4n+3)\equiv 0 \pmod{8}$ for $n\geq 0$. They also conjectured that $\overline{p}(40n+35)\equiv 0 \pmod{40}$ for $n\geq 0$.…

Combinatorics · Mathematics 2014-06-17 William Y. C. Chen , Lisa H. Sun , Rong-Hua Wang , Li Zhang

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

In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…

Combinatorics · Mathematics 2025-01-14 George E. Andrews , Rahul Kumar

The problem of computing the chromatic number of a $P_5$-free graph is known to be NP-hard. In contrast to this negative result, we show that determining whether or not a $P_5$-free graph admits a $k$-colouring, for each fixed number of…

Data Structures and Algorithms · Computer Science 2016-08-14 Chính T. Hoàng , Marcin Kamiński , Vadim Lozin , J. Sawada , X. Shu

In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…

Number Theory · Mathematics 2025-07-24 Nayandeep Deka Baruah , Subhash Chand Bhoria , Pramod Eyyunni , Bibekananda Maji

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner

Let $\mathcal{A}=(a_n)_{n\in\mathbb{N}_+}$ be a sequence of positive integers. Let $p_\mathcal{A}(n,k)$ denote the number of multi-color partitions of $n$ into parts in $\{a_1,\ldots,a_k\}$. We examine several arithmetic properties of the…

Number Theory · Mathematics 2021-04-12 Krystian Gajdzica

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

Motivated by a question of Lovejoy \cite{lovejoy}, we show that three-colored Frobenius partition function $\c3$ and related arithmetic fuction $\cc3$ vanish modulo some powers of 5 in certain arithmetic progressions.

Number Theory · Mathematics 2010-04-28 Xinhua Xiong

Ramanujan's congruence $p(5k+4) \equiv 0 \pmod 5$ led Dyson \cite{dyson} to conjecture the existence of a measure "rank" such that $p(5k+4)$ partitions of $5k+4$ could be divided into sub-classes with equal cardinality to give a direct…

Number Theory · Mathematics 2016-05-20 Rupam Barman , Archit Pal Singh Sachdeva

I discuss a variety of results involving s(n), the number of representations of n as a sum of three squares. One of my objectives is to reveal numerous interesting connections between the properties of this function and certain modular…

Number Theory · Mathematics 2012-07-05 Alexander Berkovich

This paper provides algebraic proofs for several types of congruences involving the multipartition function and self-convolutions of the divisor function. Our computations use methods of Differential Algebra in $\mathbb{Z}/q\mathbb{Z}$,…

Number Theory · Mathematics 2023-07-04 Alexandru Pascadi

We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every…

Data Structures and Algorithms · Computer Science 2015-03-20 Luisa Gargano , Adele A. Rescigno

Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…

Number Theory · Mathematics 2024-08-27 Hemjyoti Nath

Let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of weight $n$. Recently, Hirschhorn and Sellers, Yao, and Xia established a number of congruences modulo 2 and 5, 4 and 8, and 25 for $f(n)$, respectively. In this…

Number Theory · Mathematics 2017-06-12 Shane Chern

We analyze congruence classes of $S(n,k)$, the Stirling numbers of the second kind, modulo powers of 2. This analysis provides insight into a conjecture posed by Amdeberhan, Manna and Moll, which those authors established for $k\le5$. We…

Number Theory · Mathematics 2012-05-01 Curtis Bennett , Edward Mosteig

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Combinatorics · Mathematics 2017-01-23 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

Let $\bar{p}(n)$ denote the number of overpartitions of $n$. It was conjectured by Hirschhorn and Sellers that $\bar{p}(40n+35)\equiv 0\ ({\rm mod\} 40)$ for $n\geq 0$. Employing 2-dissection formulas of quotients of theta functions due to…

Combinatorics · Mathematics 2013-07-17 William Y. C. Chen , Ernest X. W. Xia