Eintrag weiter verarbeiten
p-adic class invariants
Gespeichert in:
Zeitschriftentitel: | LMS Journal of Computation and Mathematics |
---|---|
Personen und Körperschaften: | |
In: | LMS Journal of Computation and Mathematics, 14, 2011, S. 108-126 |
Format: | E-Article |
Sprache: | Englisch |
veröffentlicht: |
Wiley
|
Schlagwörter: |
author_facet |
Bröker, Reinier Bröker, Reinier |
---|---|
author |
Bröker, Reinier |
spellingShingle |
Bröker, Reinier LMS Journal of Computation and Mathematics p-adic class invariants Computational Theory and Mathematics General Mathematics |
author_sort |
bröker, reinier |
spelling |
Bröker, Reinier 1461-1570 Wiley Computational Theory and Mathematics General Mathematics http://dx.doi.org/10.1112/s1461157009000175 <jats:title>Abstract</jats:title><jats:p>We develop a new <jats:italic>p</jats:italic>-adic algorithm to compute the minimal polynomial of a class invariant. Our approach works for virtually any modular function yielding class invariants. The main algorithmic tool is modular polynomials, a concept which we generalize to functions of higher level.</jats:p> <i>p</i>-adic class invariants LMS Journal of Computation and Mathematics |
doi_str_mv |
10.1112/s1461157009000175 |
facet_avail |
Online Free |
finc_class_facet |
Mathematik |
format |
ElectronicArticle |
fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMi9zMTQ2MTE1NzAwOTAwMDE3NQ |
id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMi9zMTQ2MTE1NzAwOTAwMDE3NQ |
institution |
DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 DE-L229 |
imprint |
Wiley, 2011 |
imprint_str_mv |
Wiley, 2011 |
issn |
1461-1570 |
issn_str_mv |
1461-1570 |
language |
English |
mega_collection |
Wiley (CrossRef) |
match_str |
broker2011padicclassinvariants |
publishDateSort |
2011 |
publisher |
Wiley |
recordtype |
ai |
record_format |
ai |
series |
LMS Journal of Computation and Mathematics |
source_id |
49 |
title |
p-adic class invariants |
title_unstemmed |
p-adic class invariants |
title_full |
p-adic class invariants |
title_fullStr |
p-adic class invariants |
title_full_unstemmed |
p-adic class invariants |
title_short |
p-adic class invariants |
title_sort |
<i>p</i>-adic class invariants |
topic |
Computational Theory and Mathematics General Mathematics |
url |
http://dx.doi.org/10.1112/s1461157009000175 |
publishDate |
2011 |
physical |
108-126 |
description |
<jats:title>Abstract</jats:title><jats:p>We develop a new <jats:italic>p</jats:italic>-adic algorithm to compute the minimal polynomial of a class invariant. Our approach works for virtually any modular function yielding class invariants. The main algorithmic tool is modular polynomials, a concept which we generalize to functions of higher level.</jats:p> |
container_start_page |
108 |
container_title |
LMS Journal of Computation and Mathematics |
container_volume |
14 |
format_de105 |
Article, E-Article |
format_de14 |
Article, E-Article |
format_de15 |
Article, E-Article |
format_de520 |
Article, E-Article |
format_de540 |
Article, E-Article |
format_dech1 |
Article, E-Article |
format_ded117 |
Article, E-Article |
format_degla1 |
E-Article |
format_del152 |
Buch |
format_del189 |
Article, E-Article |
format_dezi4 |
Article |
format_dezwi2 |
Article, E-Article |
format_finc |
Article, E-Article |
format_nrw |
Article, E-Article |
_version_ |
1792321642343432205 |
geogr_code |
not assigned |
last_indexed |
2024-03-01T11:05:15.984Z |
geogr_code_person |
not assigned |
openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=p-adic+class+invariants&rft.date=2011-04-01&genre=article&issn=1461-1570&volume=14&spage=108&epage=126&pages=108-126&jtitle=LMS+Journal+of+Computation+and+Mathematics&atitle=%3Ci%3Ep%3C%2Fi%3E-adic+class+invariants&aulast=Br%C3%B6ker&aufirst=Reinier&rft_id=info%3Adoi%2F10.1112%2Fs1461157009000175&rft.language%5B0%5D=eng |
SOLR | |
_version_ | 1792321642343432205 |
author | Bröker, Reinier |
author_facet | Bröker, Reinier, Bröker, Reinier |
author_sort | bröker, reinier |
container_start_page | 108 |
container_title | LMS Journal of Computation and Mathematics |
container_volume | 14 |
description | <jats:title>Abstract</jats:title><jats:p>We develop a new <jats:italic>p</jats:italic>-adic algorithm to compute the minimal polynomial of a class invariant. Our approach works for virtually any modular function yielding class invariants. The main algorithmic tool is modular polynomials, a concept which we generalize to functions of higher level.</jats:p> |
doi_str_mv | 10.1112/s1461157009000175 |
facet_avail | Online, Free |
finc_class_facet | Mathematik |
format | ElectronicArticle |
format_de105 | Article, E-Article |
format_de14 | Article, E-Article |
format_de15 | Article, E-Article |
format_de520 | Article, E-Article |
format_de540 | Article, E-Article |
format_dech1 | Article, E-Article |
format_ded117 | Article, E-Article |
format_degla1 | E-Article |
format_del152 | Buch |
format_del189 | Article, E-Article |
format_dezi4 | Article |
format_dezwi2 | Article, E-Article |
format_finc | Article, E-Article |
format_nrw | Article, E-Article |
geogr_code | not assigned |
geogr_code_person | not assigned |
id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMi9zMTQ2MTE1NzAwOTAwMDE3NQ |
imprint | Wiley, 2011 |
imprint_str_mv | Wiley, 2011 |
institution | DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229 |
issn | 1461-1570 |
issn_str_mv | 1461-1570 |
language | English |
last_indexed | 2024-03-01T11:05:15.984Z |
match_str | broker2011padicclassinvariants |
mega_collection | Wiley (CrossRef) |
physical | 108-126 |
publishDate | 2011 |
publishDateSort | 2011 |
publisher | Wiley |
record_format | ai |
recordtype | ai |
series | LMS Journal of Computation and Mathematics |
source_id | 49 |
spelling | Bröker, Reinier 1461-1570 Wiley Computational Theory and Mathematics General Mathematics http://dx.doi.org/10.1112/s1461157009000175 <jats:title>Abstract</jats:title><jats:p>We develop a new <jats:italic>p</jats:italic>-adic algorithm to compute the minimal polynomial of a class invariant. Our approach works for virtually any modular function yielding class invariants. The main algorithmic tool is modular polynomials, a concept which we generalize to functions of higher level.</jats:p> <i>p</i>-adic class invariants LMS Journal of Computation and Mathematics |
spellingShingle | Bröker, Reinier, LMS Journal of Computation and Mathematics, p-adic class invariants, Computational Theory and Mathematics, General Mathematics |
title | p-adic class invariants |
title_full | p-adic class invariants |
title_fullStr | p-adic class invariants |
title_full_unstemmed | p-adic class invariants |
title_short | p-adic class invariants |
title_sort | <i>p</i>-adic class invariants |
title_unstemmed | p-adic class invariants |
topic | Computational Theory and Mathematics, General Mathematics |
url | http://dx.doi.org/10.1112/s1461157009000175 |