M. Merca

activity

20142026

most citedFast algorithm for generating ascending compositions

39 citations · 83 across the 24 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.NT2022★ 2 cited

Parity of 3-regular partition numbers and Diophantine equations

Cristina Ballantine, Mircea Merca, Cristian-Silviu Radu

Let $b_{3} (n)$ be the number of $3$ -regular partitions of $n$ . Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)…

math.CO2022

Dyson's crank and unimodal compositions

Cristina Ballantine, Mircea Merca

The crank is a partition statistic requested by Dyson in 1944 in order to combinatorially prove a Ramanujan congruence of Euler's partition function $p (n)$ . In this paper, we provi…