no. 15 · Monday 16 November 2026
Sparse Modular Forms, Lattices, and Codes
Abstract
Motivated by sparseness conditions for holographic CFTs, we investigate sparseness of modular forms, lattices, and codes. For this we investigate the free energy of such objects as their weight, dimension or size goes to infinity. We construct families of modular forms that are sparse, such as the Eisenstein series $E_{2k}(τ)$. We then investigate lattices that come from codes and introduce a sparseness condition for such lattices. We investigate the limit of lattices constructed from self-dual Reed-Muller codes and prove that they are sparse in this sense.
- comments
- 21 pages. v2: After publication, we found a reference that allowed us to prove sparseness of Reed-Muller code lattices. We added section 4.4 explaining this
- fields
- Number Theory