Discovering Mathematics with Magma: Reducing the Abstract to the Concrete: Algorithms and Computation in Mathematics, cartea 19
Editat de Wieb Bosma, John Cannonen Limba Engleză Paperback – 30 noi 2010
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 637.42 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 30 noi 2010 | 637.42 lei 6-8 săpt. | |
Hardback (1) | 643.08 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 23 oct 2006 | 643.08 lei 6-8 săpt. |
Din seria Algorithms and Computation in Mathematics
- 15% Preț: 657.56 lei
- 18% Preț: 714.17 lei
- 15% Preț: 590.26 lei
- Preț: 479.08 lei
- 15% Preț: 630.01 lei
- Preț: 396.91 lei
- Preț: 393.93 lei
- 18% Preț: 723.74 lei
- Preț: 389.98 lei
- 18% Preț: 1098.39 lei
- 15% Preț: 647.61 lei
- 20% Preț: 643.08 lei
- 15% Preț: 469.55 lei
- Preț: 389.39 lei
- 15% Preț: 579.20 lei
- Preț: 385.44 lei
- 20% Preț: 323.77 lei
- 18% Preț: 942.86 lei
- 23% Preț: 638.30 lei
- 15% Preț: 584.50 lei
- Preț: 390.14 lei
- 18% Preț: 771.05 lei
- 15% Preț: 686.90 lei
- 18% Preț: 744.06 lei
- 20% Preț: 1130.58 lei
- 18% Preț: 945.95 lei
- 20% Preț: 334.60 lei
- Preț: 499.21 lei
Preț: 637.42 lei
Preț vechi: 796.78 lei
-20% Nou
Puncte Express: 956
Preț estimativ în valută:
121.98€ • 128.32$ • 100.99£
121.98€ • 128.32$ • 100.99£
Carte tipărită la comandă
Livrare economică 14-28 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642072314
ISBN-10: 3642072313
Pagini: 400
Ilustrații: XXIV, 364 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642072313
Pagini: 400
Ilustrații: XXIV, 364 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Some computational experiments in number theory.- Applications of the class field theory of global fields.- Some ternary Diophantine equations of signature (n, n, 2).- Studying the Birch and Swinnerton-Dyer conjecture for modular abelian varieties using Magma.- Computing with the analytic Jacobian of a genus 2 curve.- Graded rings and special K3 surfaces.- Constructing the split octonions.- Support varieties for modules.- When is projectivity detected on subalgebras?.- Cohomology and group extensions in Magma.- Computing the primitive permutation groups of degree less than 1000.- Computer aided discovery of a fast algorithm for testing conjugacy in braid groups.- Searching for linear codes with large minimum distance.- Colouring planar graphs.- Appendix: The Magma language.
Notă biografică
Cannon:
1) Principal designer of the Magma system
2) Extensive contributions to the field of group theory algorithms
3) Awards:
Bosma: co-designer of Magma, active in computational number theory and computer algebra
1) Principal designer of the Magma system
2) Extensive contributions to the field of group theory algorithms
3) Awards:
- 1993 CSIRO Medal (for Computer Algebra)
- 2001 ATSE Clunies Ross Award (for Cryptography and Computer Algebra)
- 2006 Richard D. Jenks Memorial Prize for Excellence in Software Engineering Applied to Computer Algebra.
Bosma: co-designer of Magma, active in computational number theory and computer algebra
Textul de pe ultima copertă
This volume celebrates the first decade of the Computer Algebra system Magma. With a design based on the ontology and semantics of algebra, Magma enables users to rapidly formulate and perform calculations in the more abstract parts of mathematics. This book introduces the reader to the role Magma plays in advanced mathematical research through 14 case studies which, in most cases, describe computations underpinning new theoretical results. The authors of the chapters were chosen both for their expertise in the particular field and for their innovative use of Magma. Although by no means exhaustive, the topics range over much of Magma's coverage of algorithmic algebra: from number theory and algebraic geometry, via representation theory and group theory to some branches of discrete mathematics and graph theory. A basic introduction to the Magma language is given in an appendix. The book is simultaneously an invitation to learn a new programming language in the context of contemporary research problems, and an exposition of the types of problem that can be investigated using computational algebra.
Caracteristici
First book on the well-known MAGMA symbolic computation system