English
Related papers

Related papers: Rank, two-color partitions and Mock theta function

200 papers

In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo--Pak, proved that the partition function $p(n)$ is eventually log-concave. Inspired by this and…

Number Theory · Mathematics 2026-05-04 Kathrin Bringmann , Ben Kane , Anubhab Pahari , Larry Rolen

We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…

Combinatorics · Mathematics 2020-01-24 William J. Keith

For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…

Combinatorics · Mathematics 2013-02-18 Suping Cui , Nancy Shanshan Gu

Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…

Number Theory · Mathematics 2026-05-11 Bing He , Guanting Liu

We generalize a result of Garvan on inequalities and interpretations of the moments of the partition rank and crank functions. In particular for nearly 30 Bailey pairs, we introduce a rank-like function, establish inequalities with the…

Number Theory · Mathematics 2016-10-13 Catherine Babecki , Chris Jennings-Shaffer , Geoffrey Sangston

Recently, using modular forms and Smoot's {\tt Mathematica} implementation of Radu's algorithm for proving partition congruences, Merca proved the following two congruences: For all $n\geq 0,$ \begin{align*} A(9n+5) & \equiv 0 \pmod{3}, \\…

Number Theory · Mathematics 2022-08-25 Robson da Silva , James A. Sellers

We introduce a statistic on overpartitions called the $\overline{k}$-rank. When there are no overlined parts, this coincides with the $k$-rank of a partition introduced by Garvan. Moreover, it reduces to the D-rank of an overpartition when…

Combinatorics · Mathematics 2021-08-20 Alice X. H. Zhao

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

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

In this note, using entirely algebraic or elementary methods, we determine a new asymptotic lower bound for the number of odd values of one of the most important modular functions in number theory, the Klein $j$-function. Namely, we show…

Number Theory · Mathematics 2015-02-12 Fabrizio Zanello

Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of…

Number Theory · Mathematics 2015-11-04 Liuquan Wang

A well-studied statistic of an integer partition is the size of its Durfee square. In particular, the number $D_k (n)$ of partitions of $n$ with Durfee square of fixed size $k$ has a well-known simple rational generating function. We study…

Combinatorics · Mathematics 2025-07-28 N. Guru Sharan , Armin Straub

We study the topological version of the partition calculus in the setting of countable ordinals. Let $\alpha$ and $\beta$ be ordinals and let $k$ be a positive integer. We write $\beta\to_{top}(\alpha,k)^2$ to mean that, for every red-blue…

Logic · Mathematics 2017-07-20 Andrés Eduardo Caicedo , Jacob Hilton

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Combinatorics · Mathematics 2018-05-24 Dazhao Tang

In this paper, we obtain asymptotic formulas for $k$-crank of $k$-colored partitions. Let $M_k(a, c; n)$ denote the number of $k$-colored partitions of $n$ with a $k$-crank congruent to $a$ mod $c$. For the cases $k=2,3,4$, Fu and Tang…

Combinatorics · Mathematics 2023-04-14 Helen W. J. Zhang , Ying Zhong

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Combinatorics · Mathematics 2025-01-09 Rupam Barman , Pankaj Jyoti Mahanta , Gurinder Singh

It is well known that Ramanujan conjectured congruences modulo powers of $5$, $7$ and and $11$ for the partition function. These were subsequently proved by Watson (1938) and Atkin (1967). In 2009 Choi, Kang, and Lovejoy proved congruences…

Number Theory · Mathematics 2024-07-11 Dandan Chen , Rong Chen , Frank Garvan

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

The partition relation N \to (n)_{\ell}^k means that whenever the k-tuples of an N-element set are \ell-colored, there is a monochromatic set of size n, where a set is called monochromatic if all its k-tuples have the same color. The…

Combinatorics · Mathematics 2009-07-03 David Conlon , Jacob Fox , Benny Sudakov