(2+)-replication and the Baby Monster
classification
🧮 math.RT
keywords
replicablecompletelyfunctionsheckeoperatorsbabycdotcomputed
read the original abstract
The definitions of replicable and completely replicable functions are intimately related to the Hecke operators for the modular group. We define the notions of "$(2+)$-replicable" and "completely $(2+)$-replicable" functions by considering the Hecke operators for $\Gamma_0(2)^+$. We prove that the McKay-Thompson series for $2\cdot\mathbb{B}$, as computed by H\"ohn, are completely $(2+)$-replicable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.