Author: M. Pohst,H. Zassenhaus

Publisher: Cambridge University Press

ISBN: 9780521596695

Category: Mathematics

Page: 499

View: 3159

Classic book, addressed to all lovers of number theory.
Read More

Selected Papers From a Conference Held at the University of Heidelberg in October 1997

Author: B.Heinrich Matzat,Gert-Martin Greuel,Gerhard Hiss

Publisher: Springer Science & Business Media

ISBN: 364259932X

Category: Computers

Page: 434

View: 1325

This book contains 22 lectures presented at the final 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 researchers using com putational methods to gain insight into experimental problems and theoret ical questions in algebra and number theory. The book gives an overview on algorithmic methods and on results ob tained during this period. This includes survey articles on the main research projects within the program: • algorithmic number theory emphasizing class field theory, constructive Galois theory, computational aspects of modular forms and of Drinfeld modules • computational algebraic geometry including real quantifier elimination and real algebraic geometry, and invariant theory of finite groups • computational aspects of presentations and representations of groups, especially finite groups of Lie type and their Heeke algebras, and of the isomorphism problem in group theory. Some of the articles illustrate the current state of computer algebra sys tems and program packages developed with support by the research pro gram, such as KANT and LiDIA for algebraic number theory, SINGULAR, RED LOG and INVAR for commutative algebra and invariant theory respec tively, and GAP, SYSYPHOS and CHEVIE for group theory and representation theory.
Read More

Author: Henri Cohen

Publisher: Springer Science & Business Media

ISBN: 3662029456

Category: Mathematics

Page: 536

View: 9517

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.
Read More

Author: M.E. Pohst

Publisher: Springer Science & Business Media

ISBN: 9783764329136

Category: Juvenile Nonfiction

Page: 88

View: 1244

Computational algebraic number theory has been attracting broad interest in the last few years due to its potential applications in coding theory and cryptography. For this reason, the Deutsche Mathematiker-Vereinigung initiated an introductory graduate seminar on this topic in Dusseldorf. The lectures given there by the author served as the basis for this book which allows fast access to the state of the art in this area. Special emphasis has been placed on practical algorithms - all developed in the last five years - for the computation of integral bases, the unit group and the class group of arbitrary algebraic number fields. The workshops organized by the Gesselschaft fur mathematische Forschung in cooperation with the Deutsche Mathematiker-Vereinigung (German Mathematics Society) are intended to help, in particular, students and younger mathematicians, to obtain an introduction to fields of current research. Through the means of these well-organized seminars, scientists from other fields can also be introduced to new mathematical ideas. The publication of these workshops in the series DMV SEMINAR will make the material available to an even larger audience.
Read More

Author: Gebhard Böckle,Wolfram Decker,Gunter Malle

Publisher: Springer

ISBN: 3319705660

Category: Mathematics

Page: 763

View: 9355

This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 “Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory”, which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016. The goal of the program was to substantially advance algorithmic and experimental methods in the aforementioned disciplines, to combine the different methods where necessary, and to apply them to central questions in theory and practice. Of particular concern was the further development of freely available open source computer algebra systems and their interaction in order to create powerful new computational tools that transcend the boundaries of the individual disciplines involved. The book covers a broad range of topics addressing the design and theoretical foundations, implementation and the successful application of algebraic algorithms in order to solve mathematical research problems. It offers a valuable resource for all researchers, from graduate students through established experts, who are interested in the computational aspects of algebra, geometry, and/or number theory.
Read More

Author: E. T. Hecke

Publisher: Springer Science & Business Media

ISBN: 9780387905952

Category: Mathematics

Page: 239

View: 8313

. . . if one wants to make progress in mathematics one should study the masters not the pupils. N. H. Abel Heeke was certainly one of the masters, and in fact, the study of Heeke L series and Heeke operators has permanently embedded his name in the fabric of number theory. It is a rare occurrence when a master writes a basic book, and Heeke's Lectures on the Theory of Algebraic Numbers has become a classic. To quote another master, Andre Weil: "To improve upon Heeke, in a treatment along classical lines of the theory of algebraic numbers, would be a futile and impossible task. " We have tried to remain as close as possible to the original text in pre serving Heeke's rich, informal style of exposition. In a very few instances we have substituted modern terminology for Heeke's, e. g. , "torsion free group" for "pure group. " One problem for a student is the lack of exercises in the book. However, given the large number of texts available in algebraic number theory, this is not a serious drawback. In particular we recommend Number Fields by D. A. Marcus (Springer-Verlag) as a particularly rich source. We would like to thank James M. Vaughn Jr. and the Vaughn Foundation Fund for their encouragement and generous support of Jay R. Goldman without which this translation would never have appeared. Minneapolis George U. Brauer July 1981 Jay R.
Read More

4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings

Author: Wieb Bosma

Publisher: Springer

ISBN: 3540449949

Category: Mathematics

Page: 612

View: 1288

This book constitutes the refereed proceedings of the 4th International Algorithmic Number Theory Symposium, ANTS-IV, held in Leiden, The Netherlands, in July 2000. The book presents 36 contributed papers which have gone through a thorough round of reviewing, selection and revision. Also included are 4 invited survey papers. Among the topics addressed are gcd algorithms, primality, factoring, sieve methods, cryptography, linear algebra, lattices, algebraic number fields, class groups and fields, elliptic curves, polynomials, function fields, and power sums.
Read More

Author: Arjen K. Lenstra,Hendrik W.Jr. Lenstra

Publisher: Springer Science & Business Media

ISBN: 9783540570134

Category: Mathematics

Page: 131

View: 8949

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.
Read More

Author: Eric Bach,Jeffrey Outlaw Shallit

Publisher: MIT Press

ISBN: 9780262024051

Category: Computers

Page: 512

View: 1472

Algorithmic Number Theory provides a thorough introduction to the design and analysisof algorithms for problems from the theory of numbers. Although not an elementary textbook, itincludes over 300 exercises with suggested solutions. Every theorem not proved in the text or leftas an exercise has a reference in the notes section that appears at the end of each chapter. Thebibliography contains over 1,750 citations to the literature. Finally, it successfully blendscomputational theory with practice by covering some of the practical aspects of algorithmimplementations.The subject of algorithmic number theory represents the marriage of number theorywith the theory of computational complexity. It may be briefly defined as finding integer solutionsto equations, or proving their non-existence, making efficient use of resources such as time andspace. Implicit in this definition is the question of how to efficiently represent the objects inquestion on a computer. The problems of algorithmic number theory are important both for theirintrinsic mathematical interest and their application to random number generation, codes forreliable and secure information transmission, computer algebra, and other areas.Publisher's Note:Volume 2 was not written. Volume 1 is, therefore, a stand-alone publication.
Read More

Author: Antoine Joux

Publisher: CRC Press

ISBN: 9781420070033

Category: Computers

Page: 520

View: 5209

Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program. Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applications. The final part addresses more sophisticated cryptographic applications, including LFSR-based stream ciphers and index calculus methods. Accounting for the impact of current computer architectures, this book explores the algorithmic and implementation aspects of cryptanalysis methods. It can serve as a handbook of algorithmic methods for cryptographers as well as a textbook for undergraduate and graduate courses on cryptanalysis and cryptography.
Read More

Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings

Author: Joe P. Buhler

Publisher: Springer Science & Business Media

ISBN: 9783540646570

Category: Computers

Page: 640

View: 9823

The field of diagnostic nuclear medicine has changed significantly during the past decade. This volume is designed to present the student and the professional with a comprehensive update of recent developments not found in other textbooks on the subject. The various clinical applications of nuclear medicine techniques are extensively considered, and due attention is given also to radiopharmaceuticals, equipment and instrumentation, reconstruction techniques and the principles of gene imaging.
Read More

Proceedings of the Colloquium on Computational Number Theory held at Kossuth Lajos University, Debrecen (Hungary), September 4-9, 1989

Author: Attila Pethoe,Michael Pohst,Hugh C. Williams,Horst G. Zimmer

Publisher: Walter de Gruyter

ISBN: 3110865955

Category: Mathematics

Page: 355

View: 8131

Read More

Author: Victor Shoup

Publisher: Cambridge University Press

ISBN: 0521516447

Category: Computers

Page: 580

View: 9757

An introductory graduate-level text emphasizing algorithms and applications. This second edition includes over 200 new exercises and examples.
Read More

Second International Symposium, ANTS-II, Talence, France, May 18 - 23, 1996, Proceedings

Author: CRYPTO,France) Algorithmic Number Theory Symposium 1996 (Talence

Publisher: Springer Science & Business Media

ISBN: 9783540615811

Category: Computers

Page: 403

View: 3903

This book constitutes the refereed post-conference proceedings of the Second International Algorithmic Number Theory Symposium, ANTS-II, held in Talence, France in May 1996. The 35 revised full papers included in the book were selected from a variety of submissions. They cover a broad spectrum of topics and report state-of-the-art research results in computational number theory and complexity theory. Among the issues addressed are number fields computation, Abelian varieties, factoring algorithms, finite fields, elliptic curves, algorithm complexity, lattice theory, and coding.
Read More

Grundlagen und Anwendungen

Author: Thom Frühwirth,Slim Abdennadher

Publisher: Springer-Verlag

ISBN: 3642591159

Category: Mathematics

Page: 165

View: 1221

Das Buch gibt einen kompakten, aber umfassenden Überblick über das Problemlösen und Programmieren mit "Constraints" (Randbedingungen). Diese aktuelle Programmiermethodik ermöglicht es, Aufgaben direkt zu formulieren und effizient zu lösen. Sie gewinnt zusehends Bedeutung in Anwendungsbereichen wie Kombinatorische Suchprobleme (z.B. Zeitplanen, Layout-Optimierung), Berechnungen (Finanzanalyse), Simulation (Hardware-Verifikation) oder allgemein Schließen und Rechnen mit ungenauer oder unvollständiger Information (z.B. Kostenschätzung). Die theoretisch fundierte Darstellung mit Aufgaben und Anwendungsbeispielen aus der Praxis ist in der Lehre erprobt, aber auch für Forscher und Praktiker von Nutzen.
Read More

Author: Wieb Bosma,Alf van der Poorten

Publisher: Springer Science & Business Media

ISBN: 9401711089

Category: Mathematics

Page: 322

View: 1749

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.
Read More

Author: Bhubaneswar Mishra

Publisher: Springer Science & Business Media

ISBN: 1461243440

Category: Computers

Page: 420

View: 5944

Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner bases, characteristic sets, resultants and semialgebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems: Mathematica, Maple or Axiom, for instance. Also, researchers in robotics, solid modeling, computational geometry and automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas. The book, while being self-contained, is written at an advanced level and deals with the subject at an appropriate depth. The book is accessible to computer science students with no previous algebraic training. Some mathematical readers, on the other hand, may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book also contains a large number of exercises with solutions to selected exercises, thus making it ideal as a textbook or for self-study.
Read More

Advanced Lectures

Author: Helmut Alt

Publisher: Springer

ISBN: 354045506X

Category: Computers

Page: 173

View: 1706

This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany, as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics. The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra.
Read More