Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Eta-quotients and divisibility of certain partition functions by powers of primes (2101.06900v2)

Published 18 Jan 2021 in math.NT

Abstract: Andrews' $(k, i)$-singular overpartition function $\overline{C}{k, i}(n)$ counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined. In recent times, divisibility of $\overline{C}{3\ell, \ell}(n)$, $\overline{C}{4\ell, \ell}(n)$ and $\overline{C}{6\ell, \ell}(n)$ by $2$ and $3$ are studied for certain values of $\ell$. In this article, we study divisibility of $\overline{C}{3\ell, \ell}(n)$, $\overline{C}{4\ell, \ell}(n)$ and $\overline{C}{6\ell, \ell}(n)$ by primes $p\geq 5$. For all positive integer $\ell$ and prime divisors $p\geq 5$ of $\ell$, we prove that $\overline{C}{3\ell, \ell}(n)$, $\overline{C}{4\ell, \ell}(n)$ and $\overline{C}{6\ell, \ell}(n)$ are almost always divisible by arbitrary powers of $p$. For $s\in {3, 4, 6}$, we next show that the set of those $n$ for which $\overline{C}_{s\cdot\ell, \ell}(n) \not\equiv 0\pmod{p_ik}$ is infinite, where $k$ is a positive integer satisfying $p_i{k-1}\geq \ell$. We further improve a result of Gordon and Ono on divisibility of $\ell$-regular partitions by powers of certain primes. We also improve a result of Ray and Chakraborty on divisibility of $\ell$-regular overpartitions by powers of certain primes.

Summary

We haven't generated a summary for this paper yet.