Divisibility of an analogue of t-core partition function by powers of primes
Abstract
A partition of a positive integer n is said to be t-core if none of its hook lengths are divisible by t. Recently, two analogues, at(n) and bt(n), of the t-core partition function, ct(n), have been introduced by Gireesh, Ray and Shivashankar grs and Bandyopadhyay and Baruah bb, respectively. In this article, we prove the lacunarity of bt(n) modulo arbitrary powers of 2 and 3 for t=3α m where (m,6)=1. For a fixed positive integer k and prime numbers pi≥ 5, we also study the arithmetic density of bt(n) modulo pik where t=p1a1·s pmam. We further prove an infinite family of congruences for b3(n) modulo arbitrary powers of 2 by employing a result of Ono and Taguchi on the nilpotency of Hecke operators.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.