English
Related papers

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

200 papers

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…

Number Theory · Mathematics 2025-09-05 Ken Ono

For which values of $n$ can we color the positive integers with precisely $n$ colors in such a way that for any $a$, the numbers $a,2a,\dots,na$ all get different colors? Pach posed the question around 2008-9. Particular cases appeared in…

Number Theory · Mathematics 2021-02-16 Andrés Eduardo Caicedo , Thomas A. C. Chartier , Péter Pál Pach

We present a proof of Ramanujan's congruences $$p(5n+4) \equiv 0 \pmod 5 \text{ and } \tau(5n+5) \equiv 0 \pmod 5.$$ The proof only requires a limiting case of Jacobi's triple product, a result that Ramanujan knew well, and a technique…

Number Theory · Mathematics 2025-09-03 Hartosh Singh Bal , Gaurav Bhatnagar

Let $b_k(n)$ denote the $k-$regular partitons of a natural number $n$. In this paper, we study the behavior of $b_k(n)$ modulo composite integers $M$ which are coprime to $6$. Specially, we prove that for arbitrary $k-$regular partiton…

Number Theory · Mathematics 2022-12-12 Yiwen Lu , Xuejun Guo

In a recent work, Andrews defined the singular overpartitions with the goal of presenting an overpartition analogue to the theorems of Rogers--Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his…

Combinatorics · Mathematics 2017-12-27 Doris D. M. Sang , Diane Y. H. Shi

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

Number Theory · Mathematics 2007-05-23 Ken Ono

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Combinatorics · Mathematics 2010-02-09 Jerome Kelleher

Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…

Number Theory · Mathematics 2024-03-12 Deepthi G. , S. Chandankumar

For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. Motivated by some recent conjectures of Keith and Zanello, we establish infinite families of congruences modulo $2$…

Number Theory · Mathematics 2022-09-07 Rupam Barman , Ajit Singh , Gurinder Singh

This paper introduces the Two-Class ($r$,$k$)-Coloring problem: Given a fixed number of $k$ colors, such that only $r$ of these $k$ colors allow conflicts, what is the minimal number of conflicts incurred by an optimal coloring of the…

Computational Complexity · Computer Science 2021-08-10 Pál András Papp , Roland Schmid , Valentin Stoppiello , Roger Wattenhofer

For a positive integer $n$ let $H_n=\sum_{k=1}^{n}1/k$ be the $n$th harmonic number. Z. W. Sun conjectured that for any prime $p\ge 5$, $$ \sum_{k=1}^{p-1}\frac{H_k}{k\cdot 2^k} \equiv7/24pB_{p-3}\pmod{p^2}. $$ This conjecture is recently…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…

Number Theory · Mathematics 2025-03-03 Russelle Guadalupe

Given a simple undirected graph $G=(V,E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each part of the partition such that the chromatic number of the…

Data Structures and Algorithms · Computer Science 2020-07-29 Zhenyu Guo , Mingyu Xiao , Yi Zhou

We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…

Combinatorics · Mathematics 2014-01-29 Ivica Martinjak , Dragutin Svrtan

In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…

Number Theory · Mathematics 2020-04-07 Nicolas Allen Smoot

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…

Combinatorics · Mathematics 2022-02-08 Shishuo Fu

The chromatic number for properly colouring the facets of a combinatorial simple $n$-polytope $P^n$ that is the orbit space of a quasitoric manifold satisfies the inequality $n\leq P^n\leq 2^n-1$. The inequality is sharp for $n=2$ but not…

Combinatorics · Mathematics 2023-02-10 Djordje Baralic

In order to provide a unified combinatorial interpretation of congruences modulo $5$ for 2-colored partition functions, Garvan introduced a bicrank statistic in terms of weighted vector partitions. In this paper, we obtain some inequalities…

Combinatorics · Mathematics 2018-05-18 Shane Chern , Dazhao Tang , Liuquan Wang

Let $b_{\ell, k}(n), b_{\ell, k, r}(n)$ count the number of $(\ell, k)$, $(\ell, k, r)$-regular partitions respectively. In this paper we shall derive infinite families of congruences for $b_{\ell, k}(n)$ modulo $2$ when $ (\ell, k) =…

Number Theory · Mathematics 2023-03-27 T Kathiravan , K Srinivas , Usha K Sangale

In a recent study of sign-balanced, labelled posets Stanley [13], introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' the conjugate of pi. In [1]…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan