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 E2k(τ). 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 provide evidence that they are sparse in this sense.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…