Show simple item record

hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
hal.structure.identifierAnalyse cryptographique et arithmétique [CANARI]
dc.contributor.authorJOHANSSON, Fredrik
dc.date.accessioned2024-04-04T02:48:42Z
dc.date.available2024-04-04T02:48:42Z
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191764
dc.description.abstractEnWe consider the problem of efficiently computing isolated coefficients $c_n$ in the Fourier series of the elliptic modular function $j(\tau)$. We show that a hybrid numerical-modular method with complexity $n^{1+o(1)}$ is efficient in practice. As an application, we locate the first few values of $c_n$ that are prime, the first occurring at $n = 457871$.
dc.language.isoen
dc.title.enComputing isolated coefficients of the $j$-function
dc.typeDocument de travail - Pré-publication
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
dc.identifier.arxiv2011.14671
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-03030172
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03030172v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=JOHANSSON,%20Fredrik&rft.genre=preprint


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record