標(biāo)題: Titlebook: Algorithmic Algebra and Number Theory; Selected Papers From B. Heinrich Matzat,Gert-Martin Greuel,Gerhard Hiss Conference proceedings 1999 [打印本頁(yè)] 作者: 麻煩 時(shí)間: 2025-3-21 19:22
書目名稱Algorithmic Algebra and Number Theory影響因子(影響力)
書目名稱Algorithmic Algebra and Number Theory影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Algebra and Number Theory網(wǎng)絡(luò)公開(kāi)度
書目名稱Algorithmic Algebra and Number Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Algorithmic Algebra and Number Theory被引頻次
書目名稱Algorithmic Algebra and Number Theory被引頻次學(xué)科排名
書目名稱Algorithmic Algebra and Number Theory年度引用
書目名稱Algorithmic Algebra and Number Theory年度引用學(xué)科排名
書目名稱Algorithmic Algebra and Number Theory讀者反饋
書目名稱Algorithmic Algebra and Number Theory讀者反饋學(xué)科排名
作者: Left-Atrium 時(shí)間: 2025-3-21 23:28 作者: 相互影響 時(shí)間: 2025-3-22 02:34
Techniques for the Computation of Galois Groupsis of interest not only from the point of view of number theory (for example see the article [.] in this volume), but leads to many questions in other areas of mathematics. An example is its application in computer algebra when simplifying radical expressions [.].作者: 繞著哥哥問(wèn) 時(shí)間: 2025-3-22 07:16
On the Real Nullstellensatzerms, and a combination of Grabner basis computations with multivariate real root counting. We examine the scope of these implementations for applications in various fields of science, engineering, and economics.作者: Synthesize 時(shí)間: 2025-3-22 10:37 作者: Ingredient 時(shí)間: 2025-3-22 13:25 作者: 偏離 時(shí)間: 2025-3-22 19:07 作者: 極肥胖 時(shí)間: 2025-3-22 21:31 作者: MUMP 時(shí)間: 2025-3-23 03:18
https://doi.org/10.1007/978-3-8350-5468-4ents realize the following main ideas: 1. Minimization of resolutions are integrated as much as possible into the standard basis algorithm. 2. Hilbert functions are used to avoid reductions of useless pairs. 3. Special orderings and strategies are used to increase the computational efficiency.作者: 詩(shī)集 時(shí)間: 2025-3-23 06:46
https://doi.org/10.1007/978-3-8350-5468-4present some basic results obtained in recent years, explain the ideas behind them, and give lots of examples; proofs are usually omitted but we provide explicit references to an extensive bibliography.作者: 相同 時(shí)間: 2025-3-23 12:57 作者: 苦惱 時(shí)間: 2025-3-23 16:47 作者: Amnesty 時(shí)間: 2025-3-23 18:55
Kleinschalig, wat is dat eigenlijk?, tiber seither erreichte neue Resultate. Da inzwischen mehrere einftihrende Texte in Buchform von Matzat (1987), Serre (1992), V6lklein (1996) sowie Ishkhanov, Lure und Faddeev (1997) vorhanden sind, kann ich mich bei der Zusammenstellung der Grundlagen sehr kurz fassen. Eine ausftihrliche Darstellu作者: NEEDY 時(shí)間: 2025-3-24 00:29
Die Durchführung der Inhaltsanalyseinterest. This is documented, for example, by a regular meeting ANTS (algebraic number theory symposium) every two years whose proceedings [.], [.] give a good survey about ongoing research. Also there are several computer algebra packages concentrating on number theoretical computations. At present作者: GROUP 時(shí)間: 2025-3-24 04:42 作者: 摻假 時(shí)間: 2025-3-24 09:01 作者: Peculate 時(shí)間: 2025-3-24 10:57
Einige neuere Tendenzen beim Begriffslernene in general. In this article three results are obtruned, which provide partial remedies for these shortcomings. First, it is shown that the so-called extended Hilbert series, which can always be calculated by a MoHen type formula, yields strong constraints on the degrees of primary invariants. Then作者: BRAVE 時(shí)間: 2025-3-24 17:53 作者: Morphine 時(shí)間: 2025-3-24 22:25
https://doi.org/10.1007/978-3-8350-5468-4present some basic results obtained in recent years, explain the ideas behind them, and give lots of examples; proofs are usually omitted but we provide explicit references to an extensive bibliography.作者: 歡呼 時(shí)間: 2025-3-25 02:09 作者: 單純 時(shí)間: 2025-3-25 07:21 作者: 偶像 時(shí)間: 2025-3-25 09:17 作者: 無(wú)力更進(jìn) 時(shí)間: 2025-3-25 15:21
https://doi.org/10.1007/978-3-8350-5468-4We consider polynomials and rational functions which are invariant under the action of a finite linear group. The aim is to give a survey over the knowledge on some structural properties of such rings and fields of invariants. Particular emphasis lies on the modular case, where the characteristic of the ground field divides the group order.作者: 歌唱隊(duì) 時(shí)間: 2025-3-25 17:48 作者: 總 時(shí)間: 2025-3-25 20:45 作者: opinionated 時(shí)間: 2025-3-26 03:17 作者: 令人不快 時(shí)間: 2025-3-26 05:05 作者: 無(wú)表情 時(shí)間: 2025-3-26 09:34
Local and Global Ramification Properties of Elliptic CurvesAs is well-known, the arithmetic of elliptic curves E in characteristics two and three shows some special features peculiar to these characteristics.作者: 修剪過(guò)的樹(shù)籬 時(shí)間: 2025-3-26 14:35
A Gross-Zagier Formula for Function FieldsIn their famous article [.], Gross and Zagier proved a formula relating heights of Heegner points on modular curves and derivatives of L-series of cusp forms.作者: 繁殖 時(shí)間: 2025-3-26 17:03 作者: molest 時(shí)間: 2025-3-26 22:17
Hilbert Series and Degree Bounds in Invariant TheoryThe algorithm for computing a miniversal deformation of an isolated singularity using Massey products and its implementation in SINGULAR is explained. For completeness the cotangent cohomology and the obstruction calculus is described in concrete terms as well.作者: 谷物 時(shí)間: 2025-3-27 01:06 作者: 沙草紙 時(shí)間: 2025-3-27 06:46
Algorithms for the Computation of Free ResolutionsR. Brauer posed in his famous lectures on modern mathematics 1963 more than 40 problems, questions and conjectures about the representation theory of finite groups, cf. [.]. These questions have had a big influence on the development of the theory since then. Most of the problems may be summarized under the following central question.作者: 確保 時(shí)間: 2025-3-27 11:08 作者: olfction 時(shí)間: 2025-3-27 16:17
http://image.papertrans.cn/a/image/152881.jpg作者: Anticlimax 時(shí)間: 2025-3-27 18:06 作者: iodides 時(shí)間: 2025-3-27 23:09 作者: Abduct 時(shí)間: 2025-3-28 04:39
Sieving Methods for Class Group Computationfastest method known has conjectured sub-exponential running time and was proposed in [.]. . this paper we show how sieving methods developed for factoring algorithms can be used to speed up this algorithm in practice. We present numerical experiments which demonstrate the efficiency of our new stra作者: 參考書目 時(shí)間: 2025-3-28 07:07 作者: 排斥 時(shí)間: 2025-3-28 10:53
Fortschritte in der inversen Galoistheorie tiber seither erreichte neue Resultate. Da inzwischen mehrere einftihrende Texte in Buchform von Matzat (1987), Serre (1992), V6lklein (1996) sowie Ishkhanov, Lure und Faddeev (1997) vorhanden sind, kann ich mich bei der Zusammenstellung der Grundlagen sehr kurz fassen. Eine ausftihrliche Darstellu作者: 啟發(fā) 時(shí)間: 2025-3-28 15:20
From Class Groups to Class Fieldsinterest. This is documented, for example, by a regular meeting ANTS (algebraic number theory symposium) every two years whose proceedings [.], [.] give a good survey about ongoing research. Also there are several computer algebra packages concentrating on number theoretical computations. At present作者: 慢慢啃 時(shí)間: 2025-3-28 22:26
Extremal Latticesne in 1975; a finiteness result dealing with the hypothetical theta series of such lattices was given. Recently, H.-G. Quebbemann has extended the notion to so called modular even lattices of levels 2, 3, 5, 7, 11 and 23, and part of the genera of levels 6, 14 and 15 containing strongly modular latt作者: 發(fā)生 時(shí)間: 2025-3-29 01:52 作者: 大門在匯總 時(shí)間: 2025-3-29 05:27 作者: 四海為家的人 時(shí)間: 2025-3-29 09:03 作者: 聯(lián)想記憶 時(shí)間: 2025-3-29 13:57
Computational Aspects of the Isomorphism Problempresent some basic results obtained in recent years, explain the ideas behind them, and give lots of examples; proofs are usually omitted but we provide explicit references to an extensive bibliography.作者: obstruct 時(shí)間: 2025-3-29 19:33 作者: expository 時(shí)間: 2025-3-29 23:34 作者: 萬(wàn)神殿 時(shí)間: 2025-3-30 01:30
inal conference of the Ger- man research program (Schwerpunktprogramm) Algorithmic Number The- ory and Algebra 1991-1997, sponsored by the Deutsche Forschungsgemein- schaft. The purpose of this research program and of the meeting was to bring together developers of computer algebra software and rese作者: 聰明 時(shí)間: 2025-3-30 06:33
Kleinschalig, wat is dat eigenlijk?,shkhanov, Lure und Faddeev (1997) vorhanden sind, kann ich mich bei der Zusammenstellung der Grundlagen sehr kurz fassen. Eine ausftihrliche Darstellung mit Beweisen der meisten der hier zusammengestellten Resultate wird im Ergebnisbericht Malle, Matzat (1998) enthalten sein.作者: offense 時(shí)間: 2025-3-30 08:53
Fortschritte in der inversen Galoistheorieshkhanov, Lure und Faddeev (1997) vorhanden sind, kann ich mich bei der Zusammenstellung der Grundlagen sehr kurz fassen. Eine ausftihrliche Darstellung mit Beweisen der meisten der hier zusammengestellten Resultate wird im Ergebnisbericht Malle, Matzat (1998) enthalten sein.作者: 憎惡 時(shí)間: 2025-3-30 12:24
Judith Palm,Stefanie Alkier-Karweicktegy. For example, we are able to compute the class group of an imaginary quadratic field with a discriminant of 55 digits 20 times as fast as S. Düllmann in an earlier record-setting implementation ([.]) which did not use sieving techniques. We also present class numbers of large cubic fields.作者: falsehood 時(shí)間: 2025-3-30 18:14 作者: 輕快帶來(lái)危險(xiǎn) 時(shí)間: 2025-3-30 21:31 作者: deface 時(shí)間: 2025-3-31 02:18
https://doi.org/10.1007/978-3-642-70651-6 such lattices. Using an obvious generalization of the notion of extremality, similar results are obtained for other genera of levels 6, 14 and 15, and for the levels 10 and 21 not considered before. For the construction of lattices, a computer implementation of Kneser’s neighbor method is an important tool.作者: 易發(fā)怒 時(shí)間: 2025-3-31 06:13
