(2+)-replication and the Baby Monster
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/108065 https://doi.org/10.3842/SIGMA.2018.060 |
Resumo: | 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. |
id |
RCAP_0a597914546d0059accaffc073f7c816 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/108065 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
(2+)-replication and the Baby Monstermoonshinebaby monsterreplicationThe 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.Department of Applied Research, Institute of Mathematics of National Academy of Science of Ukraine2017-10-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/108065http://hdl.handle.net/10316/108065https://doi.org/10.3842/SIGMA.2018.060eng18150659Cummins, ChrisMatias, Rodrigoinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-08-16T12:55:29Zoai:estudogeral.uc.pt:10316/108065Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:24:20.064802Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
(2+)-replication and the Baby Monster |
title |
(2+)-replication and the Baby Monster |
spellingShingle |
(2+)-replication and the Baby Monster Cummins, Chris moonshine baby monster replication |
title_short |
(2+)-replication and the Baby Monster |
title_full |
(2+)-replication and the Baby Monster |
title_fullStr |
(2+)-replication and the Baby Monster |
title_full_unstemmed |
(2+)-replication and the Baby Monster |
title_sort |
(2+)-replication and the Baby Monster |
author |
Cummins, Chris |
author_facet |
Cummins, Chris Matias, Rodrigo |
author_role |
author |
author2 |
Matias, Rodrigo |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Cummins, Chris Matias, Rodrigo |
dc.subject.por.fl_str_mv |
moonshine baby monster replication |
topic |
moonshine baby monster replication |
description |
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. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-10-03 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/108065 http://hdl.handle.net/10316/108065 https://doi.org/10.3842/SIGMA.2018.060 |
url |
http://hdl.handle.net/10316/108065 https://doi.org/10.3842/SIGMA.2018.060 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
18150659 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Department of Applied Research, Institute of Mathematics of National Academy of Science of Ukraine |
publisher.none.fl_str_mv |
Department of Applied Research, Institute of Mathematics of National Academy of Science of Ukraine |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799134128506929152 |