Identical Vanishing of Coefficients in the Series Expansion of Eta Quotients, modulo 4, 9 and 25
Abstract
Let A(q)=Σn=0∞an qn and B(q)=Σn=0∞bn qn be two eta quotients. Previously, we considered the problem of when \[ an=0 <=> bn=0. \] Here we consider the ``mod m'' version of this problem, i.e. eta quotients A(q) and B(q) and integers m>1 such that \[ an 0 m <=> bn 0 m? \] We found results for m=p2, p=2, 3 and 5. For m=4,9, we found results which apply to infinite families of eta quotients. For example: Let A(q) have the form equation A(q) = f13j1+1Π3 ifi3jiΠ3|ifiji =: Σn=0∞anqn,\,\,B(q) = f3f13A(q) =: Σn=0∞bnqn equation with fk=Πn=1∞(1-qkn). Then align* a3n-b3n& 0 9,\\ 2a3n+1+b3n+1&0 9,\\ a3n+2+2b3n+2&0 9. align* Some of these theorems also had some combinatorial implications, such as the following: Let p2(3)(n) denote the number of bipartitions (π1, π2) of n where π1 is 3-regular. Then equation* p2(3)(n)0 9 <=> n is not a generalized pentagonal number. equation* In the case of m=25, we do not have any general theorems that apply to an infinite family of eta quotients. Instead we give two tables of results that appear to hold experimentally. We do prove some individual results (using theory of modular forms), such as the following: Let the sequences \cn\ and \dn\ be defined by equation* f110=:Σn=0∞cnqn, 25pt f15f5=:Σn=0∞dnqn. equation* Then equation* cn 0 25 <=> dn 0 25. equation*
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.