Author : Wolfram Decker
Publisher : Cambridge University Press
Page : 127 pages
File Size : 29,42 MB
Release : 2013-02-07
Category : Computers
ISBN : 1107612535
A quick guide to computing in algebraic geometry with many explicit computational examples introducing the computer algebra system Singular.
Author : Franco P. Preparata
Publisher : Springer Science & Business Media
Page : 413 pages
File Size : 12,69 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461210984
From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. ... ... The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two." #Mathematical Reviews#1 "... This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics." #Biometrical Journal#2
Author : Ihsen Yengui
Publisher : World Scientific
Page : 283 pages
File Size : 19,21 MB
Release : 2021-05-17
Category : Mathematics
ISBN : 981123826X
This book intends to provide material for a graduate course on computational commutative algebra and algebraic geometry, highlighting potential applications in cryptography. Also, the topics in this book could form the basis of a graduate course that acts as a segue between an introductory algebra course and the more technical topics of commutative algebra and algebraic geometry.This book contains a total of 124 exercises with detailed solutions as well as an important number of examples that illustrate definitions, theorems, and methods. This is very important for students or researchers who are not familiar with the topics discussed. Experience has shown that beginners who want to take their first steps in algebraic geometry are usually discouraged by the difficulty of the proposed exercises and the absence of detailed answers. Therefore, exercises (and their solutions) as well as examples occupy a prominent place in this course.This book is not designed as a comprehensive reference work, but rather as a selective textbook. The many exercises with detailed answers make it suitable for use in both a math or computer science course.
Author : Kristin Estella Lauter
Publisher : American Mathematical Soc.
Page : 146 pages
File Size : 28,67 MB
Release : 2008
Category : Mathematics
ISBN : 0821843206
With the recent increase in available computing power, new computations are possible in many areas of arithmetic geometry. To name just a few examples, Cremona's tables of elliptic curves now go up to conductor 120,000 instead of just conductor 1,000, tables of Hilbert class fields are known for discriminant up to at least 5,000, and special values of Hilbert and Siegel modular forms can be calculated to extremely high precision. In many cases, these experimental capabilities haveled to new observations and ideas for progress in the field. They have also led to natural algorithmic questions on the feasibility and efficiency of many computations, especially for the purpose of applications in cryptography. The AMS Special Session on Computational Arithmetic Geometry, held onApril 29-30, 2006, in San Francisco, CA, gathered together many of the people currently working on the computational and algorithmic aspects of arithmetic geometry. This volume contains research articles related to talks given at the session. The majority of articles are devoted to various aspects of arithmetic geometry, mainly with a computational approach.
Author : Avi Wigderson
Publisher : Princeton University Press
Page : 434 pages
File Size : 49,10 MB
Release : 2019-10-29
Category : Computers
ISBN : 0691189137
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Author : David Eisenbud
Publisher : Springer Science & Business Media
Page : 354 pages
File Size : 12,51 MB
Release : 2001-09-25
Category : Mathematics
ISBN : 9783540422303
This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.
Author : L. Pachter
Publisher : Cambridge University Press
Page : 440 pages
File Size : 49,63 MB
Release : 2005-08-22
Category : Mathematics
ISBN : 9780521857000
This book, first published in 2005, offers an introduction to the application of algebraic statistics to computational biology.
Author : Qing Liu
Publisher : Oxford University Press
Page : 593 pages
File Size : 33,8 MB
Release : 2006-06-29
Category : Mathematics
ISBN : 0191547808
This book is a general introduction to the theory of schemes, followed by applications to arithmetic surfaces and to the theory of reduction of algebraic curves. The first part introduces basic objects such as schemes, morphisms, base change, local properties (normality, regularity, Zariski's Main Theorem). This is followed by the more global aspect: coherent sheaves and a finiteness theorem for their cohomology groups. Then follows a chapter on sheaves of differentials, dualizing sheaves, and Grothendieck's duality theory. The first part ends with the theorem of Riemann-Roch and its application to the study of smooth projective curves over a field. Singular curves are treated through a detailed study of the Picard group. The second part starts with blowing-ups and desingularisation (embedded or not) of fibered surfaces over a Dedekind ring that leads on to intersection theory on arithmetic surfaces. Castelnuovo's criterion is proved and also the existence of the minimal regular model. This leads to the study of reduction of algebraic curves. The case of elliptic curves is studied in detail. The book concludes with the funadmental theorem of stable reduction of Deligne-Mumford. The book is essentially self-contained, including the necessary material on commutative algebra. The prerequisites are therefore few, and the book should suit a graduate student. It contains many examples and nearly 600 exercises.
Author : Joseph O'Rourke
Publisher : Cambridge University Press
Page : 396 pages
File Size : 24,64 MB
Release : 1998-10-13
Category : Computers
ISBN : 110726863X
This is the revised and expanded 1998 edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. The code in this edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
Author : Jennifer S. Balakrishnan
Publisher : Springer Nature
Page : 587 pages
File Size : 41,24 MB
Release : 2022-03-15
Category : Mathematics
ISBN : 3030809145
This volume contains articles related to the work of the Simons Collaboration “Arithmetic Geometry, Number Theory, and Computation.” The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Database (LMFDB). The authors aim to develop systematic tools for analyzing Diophantine properties of curves, surfaces, and abelian varieties over number fields and finite fields. The articles also explore examples important for future research. Specific topics include● algebraic varieties over finite fields● the Chabauty-Coleman method● modular forms● rational points on curves of small genus● S-unit equations and integral points.
