English
Related papers

Related papers: Arithmetic Properties of Overcolored Odd Partition…

200 papers

We prove an infinite family of Hecke-like congruences for the overpartition function modulo powers of 2. Starting from a recent identity of Garvan and Morrow and iterating Atkin's $U_2$ operator, we determine lower bounds on the 2-adic…

Number Theory · Mathematics 2025-10-24 Zhumagali Shomanov , Frank Garvan

We prove that for every $d\in \mathbb{N}$ and a graph class of bounded expansion $\mathscr{C}$, there exists some $c\in \mathbb{N}$ so that every graph from $\mathscr{C}$ admits a proper coloring with at most $c$ colors satisfying the…

Combinatorics · Mathematics 2025-05-22 Michał Pilipczuk

Recently, Lin introduced two new partition functions PD$_t(n)$ and PDO$_t(n)$, which count the total number of tagged parts over all partitions of $n$ with designated summands and the total number of tagged parts over all partitions of $n$…

Number Theory · Mathematics 2023-01-30 Nayandeep Deka Baruah , Mandeep Kaur

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

Number Theory · Mathematics 2021-09-16 Riyajur Rahman , Nipen Saikia

Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\equiv 0 \pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by…

Number Theory · Mathematics 2018-08-13 Chiranjit Ray , Rupam Barman

In this article we exhibit new explicit families of congruences for the overpartition function, making effective the existence results given previously by Treneer. We give infinite families of congruences modulo $m$ for $m = 5, 7, 11$, and…

Number Theory · Mathematics 2024-10-16 Nathan C. Ryan , Nicolás Sirolli , Jean Carlos Villegas-Morales , Qi-Yang Zheng

Hirschhorn and Sellers studied arithmetic properties of the number of partitions with odd parts distinct. In another direction, Hammond and Lewis investigated arithmetic properties of the number of bipartitions. In this paper, we consider…

Combinatorics · Mathematics 2010-04-06 William Y. C. Chen , Bernard L. S. Lin

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

Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…

Combinatorics · Mathematics 2017-10-25 Shane Chern

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…

Number Theory · Mathematics 2023-02-03 Cristina Ballantine , Mircea Merca

Let $\overline{bt}(n)$ denote the number of overcubic partition triples of $n$. Nayaka, Dharmendra and Kumar proved some congruences modulo 8, 16 and 32 for $\overline{bt}(n)$. Recently, Saikia and Sarma established some congruences modulo…

Number Theory · Mathematics 2025-04-10 Jiayu Chen , Jing Jin , Olivia X. M. Yao

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

In 1984, Andrews introduced the family of partition functions \(c\phi_k(n)\), which counts the number of generalized Frobenius partitions of \(n\) with \(k\) colors. In previous work, we proved a conjecture on congruences for \(c\phi_6(n)\)…

Combinatorics · Mathematics 2026-04-17 Dandan Chen , Siyu Yin

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…

Combinatorics · Mathematics 2024-02-21 Sandro Roch

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

In this article, we study the arithmetic properties of the partition function $p_8(n)$, the number of 8-colour partitions of $n$. We prove several Ramanujan type congruences modulo higher powers of 2 for the function $p_8(n)$ by finding…

Number Theory · Mathematics 2019-06-25 B. Hemanthkumar , H. S. Sumanth Bharadwaj

A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…

Number Theory · Mathematics 2025-05-19 Tewodros Amdeberhan , James A. Sellers , Ajit Singh

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

Combinatorics · Mathematics 2018-03-14 Julia Q. D. Du , Edward Y. S. Liu , Jack C. D. Zhao

Lin introduced the partition function $\text{PDO}_t(n)$, which counts the total number of tagged parts over all the partitions of $n$ with designated summands in which all parts are odd. For $k\geq0$, Lin conjectured congruences for…

Number Theory · Mathematics 2023-07-11 Gurinder Singh , Rupam Barman

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Number Theory · Mathematics 2025-05-28 Shane Chern , James A. Sellers