Search arXivSearch

arXiv · 1907.06716

Ramanujan Congruences for Fractional Partition Functions

Abstract

For rational $α$, the fractional partition functions $p_α(n)$ are given by the coefficients of the generating function $(q;q)^α_\infty$. When $α=-1$, one obtains the usual partition function. Congruences of the form $p(\ell n + c)\equiv 0 \pmod{\ell}$ for a prime $\ell$ and integer $c$ were studied by Ramanujan. Such congruences exist only for $\ell\in\{5,7,11\}.$ Chan and Wang [4] recently studied congruences for the fractional partition functions and gave several infinite families of congruences using identities of the Dedekind eta-function. Following their work, we use the theory of non-ordinary primes to find a general framework that characterizes congruences modulo any integer. This allows us to prove new congruences such as $p_\frac{57}{61}(17^2n-3)\equiv 0 \pmod{17^2}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erin Bevilacqua, Kapil Chandran, Yunseo Choi. 2019-07-15. Ramanujan Congruences for Fractional Partition Functions. https://arxiv.org/abs/1907.06716

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT