{"title":"有限域上二阶Drinfeld模的模多项式和等同性计算","authors":"Perlas Caranay, Matthew Greenberg, R. Scheidler","doi":"10.1090/conm/754/15148","DOIUrl":null,"url":null,"abstract":"Summary: We present algorithms for computing j -invariants, modular polynomials and explicit isogenies for ordinary rank 2 Drinfeld modules over finite fields and describe how Drinfeld modular polynomials can be used to compute isogeny graphs and endomorphism rings of ordinary rank 2 Drinfeld modules. Our technique for computing Drinfeld modular polynomials is based on the traditional analytic approach for obtaining classical modular polynomials. Our ideas for generating isogeny graphs and finding endomorphism rings for rank 2 Drinfeld modules closely follows the work of Kohel and Fouquet. All our algorithms were implemented in SAGE and numerical examples are included. For the entire collection see [Zbl 1461.11002].","PeriodicalId":369218,"journal":{"name":"75 Years of Mathematics of\n Computation","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields\",\"authors\":\"Perlas Caranay, Matthew Greenberg, R. Scheidler\",\"doi\":\"10.1090/conm/754/15148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary: We present algorithms for computing j -invariants, modular polynomials and explicit isogenies for ordinary rank 2 Drinfeld modules over finite fields and describe how Drinfeld modular polynomials can be used to compute isogeny graphs and endomorphism rings of ordinary rank 2 Drinfeld modules. Our technique for computing Drinfeld modular polynomials is based on the traditional analytic approach for obtaining classical modular polynomials. Our ideas for generating isogeny graphs and finding endomorphism rings for rank 2 Drinfeld modules closely follows the work of Kohel and Fouquet. All our algorithms were implemented in SAGE and numerical examples are included. For the entire collection see [Zbl 1461.11002].\",\"PeriodicalId\":369218,\"journal\":{\"name\":\"75 Years of Mathematics of\\n Computation\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"75 Years of Mathematics of\\n Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/conm/754/15148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"75 Years of Mathematics of\n Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/conm/754/15148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
Summary: We present algorithms for computing j -invariants, modular polynomials and explicit isogenies for ordinary rank 2 Drinfeld modules over finite fields and describe how Drinfeld modular polynomials can be used to compute isogeny graphs and endomorphism rings of ordinary rank 2 Drinfeld modules. Our technique for computing Drinfeld modular polynomials is based on the traditional analytic approach for obtaining classical modular polynomials. Our ideas for generating isogeny graphs and finding endomorphism rings for rank 2 Drinfeld modules closely follows the work of Kohel and Fouquet. All our algorithms were implemented in SAGE and numerical examples are included. For the entire collection see [Zbl 1461.11002].