Papers
Topics
Authors
Recent
Search
2000 character limit reached

Andrews-Beck type congrences modulo powers of 5

Published 9 Mar 2023 in math.NT | (2303.05268v1)

Abstract: Let $NT(m, k, n)$ denote the total number of parts in the partitions of n with rank congruent to m modulo k. Andrews proved Beck's conjecture on congruences for $NT(m, k, n)$ modulo 5 and 7. Generalizing Andrews'results, Chern obtain congruences for $NT(m, k, n)$ modulo 11 and 13. More recently, the second author use the theory of Hecke operators to establish congruences for such partition statistics modulo powers of primes $\ell \ge 7$. In this paper, we obtain Andrews-Beck type congruences modulo powers of 5.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.