標(biāo)題: Titlebook: Discovering Mathematics with Magma; Reducing the Abstrac Wieb Bosma,John Cannon Book 2006 Springer-Verlag Berlin Heidelberg 2006 Magma.Perm [打印本頁] 作者: Johnson 時間: 2025-3-21 16:25
書目名稱Discovering Mathematics with Magma影響因子(影響力)
書目名稱Discovering Mathematics with Magma影響因子(影響力)學(xué)科排名
書目名稱Discovering Mathematics with Magma網(wǎng)絡(luò)公開度
書目名稱Discovering Mathematics with Magma網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discovering Mathematics with Magma被引頻次
書目名稱Discovering Mathematics with Magma被引頻次學(xué)科排名
書目名稱Discovering Mathematics with Magma年度引用
書目名稱Discovering Mathematics with Magma年度引用學(xué)科排名
書目名稱Discovering Mathematics with Magma讀者反饋
書目名稱Discovering Mathematics with Magma讀者反饋學(xué)科排名
作者: tympanometry 時間: 2025-3-21 22:46 作者: 佛刊 時間: 2025-3-22 02:30 作者: Obverse 時間: 2025-3-22 05:14 作者: 咽下 時間: 2025-3-22 10:47
Computing with the analytic Jacobian of a genus 2 curve,escribed Complex Multiplication. We treat 2 fields, one easy and one harder. Secondly we show how . can be used to find, and ultimately prove existence of, rational isogenies between the Jacobians of two genus 2 curves.作者: 地名表 時間: 2025-3-22 15:26
Graded rings and special K3 surfaces,as an application, construct 27 families of K3 surfaces that appear as degenerate cases of surfaces in the usual lists. These are displayed in Tables 1–3 and include both standard degenerations and new examples.作者: 地名表 時間: 2025-3-22 20:34 作者: carotid-bruit 時間: 2025-3-22 23:35
Computer aided discovery of a fast algorithm for testing conjugacy in braid groups,id group. These investigations ultimately lead to the discovery of a new invariant of conjugacy classes in braid groups, to an efficient way of computing this invariant, and in particular to a much more powerful conjugacy test than the one which was originally to be implemented [11].作者: sed-rate 時間: 2025-3-23 02:31 作者: jagged 時間: 2025-3-23 09:10
Studying the Birch and Swinnerton-Dyer conjecture for modular abelian varieties using Magma,ssume the reader has proficiency working with elliptic curves, abelian varieties, modular forms, or modular symbols. The computations give evidence for the Birch and Swinnerton- Dyer conjecture and increase our explicit understanding of modular abelian varieties.作者: Pathogen 時間: 2025-3-23 13:28 作者: conduct 時間: 2025-3-23 16:05
1431-1550 teralgebrasystemlaunchedattheFirstMagmaConferenceonCom- tational Algebra held at Queen Mary and West?eld College, London, August 1993. This book introduces the reader to the role Magma plays in advanced mathematical research. Each paper examines how the computer can be used to gain insight into eith作者: ambivalence 時間: 2025-3-23 18:02
https://doi.org/10.1007/978-981-19-6120-5ssume the reader has proficiency working with elliptic curves, abelian varieties, modular forms, or modular symbols. The computations give evidence for the Birch and Swinnerton- Dyer conjecture and increase our explicit understanding of modular abelian varieties.作者: STALL 時間: 2025-3-24 00:27
Applications of the class field theory of global fields,e 1 over finite fields. After a brief review of the handling of both function and number fields in ., we give an introduction to computational class field theory focusing on applications: We show how to construct tables of small degree extensions and how to utilize the class field theory to find curves with many rational points.x作者: Lumbar-Stenosis 時間: 2025-3-24 04:26 作者: 有節(jié)制 時間: 2025-3-24 08:50
Graded rings and special K3 surfaces,as an application, construct 27 families of K3 surfaces that appear as degenerate cases of surfaces in the usual lists. These are displayed in Tables 1–3 and include both standard degenerations and new examples.作者: 誹謗 時間: 2025-3-24 12:56
When is projectivity detected on subalgebras?, when its restrictions to all elementary abelian .-subgroups of . are projective. We investigate some similar situations in which the restrictions to subalgebras detect the projectivity of a module over an algebra.作者: famine 時間: 2025-3-24 15:11
Computer aided discovery of a fast algorithm for testing conjugacy in braid groups,id group. These investigations ultimately lead to the discovery of a new invariant of conjugacy classes in braid groups, to an efficient way of computing this invariant, and in particular to a much more powerful conjugacy test than the one which was originally to be implemented [11].作者: 矛盾心理 時間: 2025-3-24 20:36
Searching for linear codes with large minimum distance, with large minimum distance. In the course of the project, many algorithms to construct and search for good codes have been devised, and some are presented here. In particular, a very efficient algorithm for computing the minimum distance of a code has been developed.作者: 合群 時間: 2025-3-25 01:38
https://doi.org/10.1007/978-981-10-4796-1The . code and some computational results of experiments in number theory are given. The experiments concern covering systems with applications to explicit primality tests, the inverse of Euler’s totient function, and class number relations in Galois extensions of ?. Some evidence for various conjectures and open problems is given.作者: Habituate 時間: 2025-3-25 06:28
https://doi.org/10.1007/978-981-19-6120-5In this article, we will determine the primitive integral solutions . to equations of the form作者: 偶然 時間: 2025-3-25 08:01
https://doi.org/10.1007/978-1-349-22396-1In this chapter we construct the split octonion algebra over a ring, first using the structure constant machinery of . and then using Lie algebras.作者: exigent 時間: 2025-3-25 12:06
https://doi.org/10.1007/978-3-642-60752-3The support variety of a module over a group algebra is an affine variety that encodes many of the homological properties of the module. Although the definition of the support variety is given in terms of the cohomology ring of the group, it can be computed directly from the actions of the elementary abelian subgroups.作者: BOAST 時間: 2025-3-25 19:34
Extracorporeal PhotochemotherapyWe describe the theory and implementation of some new and more flexible . functions for computing cohomology groups of finite groups, and their application to the computation of group extensions.作者: 舊石器 時間: 2025-3-25 23:09
Interferon-α Therapy in DermatologyIn this chapter we describe how . was used to complete the classification of the primitive groups of degree less than 1000.作者: FLAIL 時間: 2025-3-26 02:56
Grasping the Open School InitiativeThere is no known polynomial time 4-colouring algorithm for planar graphs, except the algorithms that can be derived from the proofs of Appel . and Robertson . An alternative way to colour planar graphs is to investigate the problem of finding nowhere-zero .-flows in graphs.作者: FRET 時間: 2025-3-26 07:15 作者: 課程 時間: 2025-3-26 12:03
Some computational experiments in number theory,The . code and some computational results of experiments in number theory are given. The experiments concern covering systems with applications to explicit primality tests, the inverse of Euler’s totient function, and class number relations in Galois extensions of ?. Some evidence for various conjectures and open problems is given.作者: Hormones 時間: 2025-3-26 16:22
Some ternary Diophantine equations of signature (,, ,, 2),In this article, we will determine the primitive integral solutions . to equations of the form作者: LUDE 時間: 2025-3-26 18:43
Constructing the split octonions,In this chapter we construct the split octonion algebra over a ring, first using the structure constant machinery of . and then using Lie algebras.作者: 裂縫 時間: 2025-3-26 21:42
Support varieties for modules,The support variety of a module over a group algebra is an affine variety that encodes many of the homological properties of the module. Although the definition of the support variety is given in terms of the cohomology ring of the group, it can be computed directly from the actions of the elementary abelian subgroups.作者: AUGUR 時間: 2025-3-27 01:34
Cohomology and group extensions in Magma,We describe the theory and implementation of some new and more flexible . functions for computing cohomology groups of finite groups, and their application to the computation of group extensions.作者: 改變 時間: 2025-3-27 07:42
Computing the primitive permutation groups of degree less than 1000,In this chapter we describe how . was used to complete the classification of the primitive groups of degree less than 1000.作者: Narcissist 時間: 2025-3-27 12:55 作者: Evacuate 時間: 2025-3-27 15:41
Appendix: The Magma language,The following is a brief introduction to the . language. It is not a comprehensive description of the language, nor is it a programming tutorial (although, inevitably, it has much in common with one).作者: 影響 時間: 2025-3-27 20:59 作者: fatty-streak 時間: 2025-3-27 23:40 作者: 獎牌 時間: 2025-3-28 02:07
Center for China and Globalization (CCG)e 1 over finite fields. After a brief review of the handling of both function and number fields in ., we give an introduction to computational class field theory focusing on applications: We show how to construct tables of small degree extensions and how to utilize the class field theory to find cur作者: 使顯得不重要 時間: 2025-3-28 09:59 作者: 仔細(xì)閱讀 時間: 2025-3-28 13:05
Center for China and Globalization (CCG)escribed Complex Multiplication. We treat 2 fields, one easy and one harder. Secondly we show how . can be used to find, and ultimately prove existence of, rational isogenies between the Jacobians of two genus 2 curves.作者: Inculcate 時間: 2025-3-28 15:26 作者: GLEAN 時間: 2025-3-28 20:54
https://doi.org/10.1007/978-3-642-60752-3 when its restrictions to all elementary abelian .-subgroups of . are projective. We investigate some similar situations in which the restrictions to subalgebras detect the projectivity of a module over an algebra.作者: Vasodilation 時間: 2025-3-28 23:11 作者: initiate 時間: 2025-3-29 04:10 作者: 思考 時間: 2025-3-29 09:40
https://doi.org/10.1007/978-3-540-37634-7Magma; Permutation; Signatur; algebra; algorithms; code; computer; computer algebra; computer algebra system作者: Distribution 時間: 2025-3-29 13:05
978-3-642-07231-4Springer-Verlag Berlin Heidelberg 2006作者: 變白 時間: 2025-3-29 18:17 作者: Collar 時間: 2025-3-29 23:18 作者: Stable-Angina 時間: 2025-3-30 00:53
