Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond
Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond

Author: Teo Mora

Publisher: Cambridge University Press

Published: 2016-04-01

Total Pages: 833

ISBN-13: 1316381382

DOWNLOAD EBOOK

In this fourth and final volume the author extends Buchberger's Algorithm in three different directions. First, he extends the theory to group rings and other Ore-like extensions, and provides an operative scheme that allows one to set a Buchberger theory over any effective associative ring. Second, he covers similar extensions as tools for discussing parametric polynomial systems, the notion of SAGBI-bases, Gröbner bases over invariant rings and Hironaka's theory. Finally, Mora shows how Hilbert's followers - notably Janet, Gunther and Macaulay - anticipated Buchberger's ideas and discusses the most promising recent alternatives by Gerdt (involutive bases) and Faugère (F4 and F5). This comprehensive treatment in four volumes is a significant contribution to algorithmic commutative algebra that will be essential reading for algebraists and algebraic geometers.

Solving Polynomial Equation Systems
Solving Polynomial Equation Systems

Author: Teo Mora

Publisher: Cambridge University Press

Published: 2003

Total Pages: 833

ISBN-13: 1107109639

DOWNLOAD EBOOK

Covers extensions of Buchberger's Theory and Algorithm, and promising recent alternatives to Gröbner bases.

Computer Algebra in Scientific Computing
Computer Algebra in Scientific Computing

Author: François Boulier

Publisher: Springer Nature

Published: 2023-08-23

Total Pages: 441

ISBN-13: 3031417240

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 25th International Workshop on Computer Algebra in Scientific Computing, CASC 2023, which took place in Havana, Cuba, during August 28-September 1, 2023. The 22 full papers included in this book were carefully reviewed and selected from 29 submissions. They focus on the theory of symbolic computation and its implementation in computer algebra systems as well as all other areas of scientific computing with regard to their benefit from or use of computer algebra methods and software.

Intelligent Computer Mathematics
Intelligent Computer Mathematics

Author: Christoph Benzmüller

Publisher: Springer Nature

Published: 2020-07-17

Total Pages: 337

ISBN-13: 3030535185

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 13th International Conference on Intelligent Computer Mathematics, CICM 2020, held in Bertinoro, Italy, in July 2020*. The 15 full papers, 1 invited paper and 2 abstracts of invited papers presented were carefully reviewed and selected from a total of 35 submissions. The papers focus on advances in automated theorem provers and formalization, computer algebra systems and their libraries, and applications of machine learning, among other topics. * The conference was held virtually due to the COVID-19 pandemic.

An Invitation to Analytic Combinatorics
An Invitation to Analytic Combinatorics

Author: Stephen Melczer

Publisher: Springer Nature

Published: 2020-12-22

Total Pages: 418

ISBN-13: 3030670805

DOWNLOAD EBOOK

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

Solving Polynomial Equation Systems
Solving Polynomial Equation Systems

Author: Teo Mora

Publisher:

Published: 2003

Total Pages: 439

ISBN-13: 9780511178887

DOWNLOAD EBOOK

Mora covers the classical theory of finding roots of a univariate polynomial, emphasising computational aspects. He shows that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate polynomials.

Computer Algebra Methods for Equivariant Dynamical Systems
Computer Algebra Methods for Equivariant Dynamical Systems

Author: Karin Gatermann

Publisher: Springer

Published: 2007-05-06

Total Pages: 163

ISBN-13: 3540465197

DOWNLOAD EBOOK

This book starts with an overview of the research of Gröbner bases which have many applications in various areas of mathematics since they are a general tool for the investigation of polynomial systems. The next chapter describes algorithms in invariant theory including many examples and time tables. These techniques are applied in the chapters on symmetric bifurcation theory and equivariant dynamics. This combination of different areas of mathematics will be interesting to researchers in computational algebra and/or dynamics.

Computer Algebra and Symbolic Computation
Computer Algebra and Symbolic Computation

Author: Joel S. Cohen

Publisher: CRC Press

Published: 2002-07-19

Total Pages: 323

ISBN-13: 1439863695

DOWNLOAD EBOOK

This book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and

Computational Mathematics with SageMath
Computational Mathematics with SageMath

Author: P. Zimmermann

Publisher: SIAM

Published: 2018-12-10

Total Pages: 459

ISBN-13: 161197545X

DOWNLOAD EBOOK

This fantastic and deep book about how to use Sage for learning and doing mathematics at all levels perfectly complements the existing Sage documentation. It is filled with many carefully thought through examples and exercises, and great care has been taken to put computational functionality into proper mathematical context. Flip to almost any random page in this amazing book, and you will learn how to play with and visualize some beautiful part of mathematics. --- William A. Stein, CEO, SageMath, and professor of mathematics, University of Washington SageMath, or Sage for short, is an open-source mathematical software system based on the Python language and developed by an international community comprising hundreds of teachers and researchers, whose aim is to provide an alternative to the commercial products Magma, Maple, Mathematica, and MATLAB. To achieve this, Sage relies on many open-source programs, including GAP, Maxima, PARI, and various scientific libraries for Python, to which thousands of new functions have been added. Sage is freely available and is supported by all modern operating systems. Sage provides a wonderful scientific and graphical calculator for high school students, and it efficiently supports undergraduates in their computations in analysis, linear algebra, calculus, etc. For graduate students, researchers, and engineers in various mathematical specialties, Sage provides the most recent algorithms and tools, which is why several universities around the world already use Sage at the undergraduate level.