𝔖 Scriptorium
✦   LIBER   ✦

📁

Concrete Abstract Algebra: From Numbers to Gröbner Bases

✍ Scribed by Niels Lauritzen


Publisher
Cambridge University Press
Year
2003
Tongue
English
Leaves
255
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Concrete Abstract Algebra develops the theory of abstract algebra from numbers to Gr"obner bases, while takin in all the usual material of a traditional introductory course. In addition, there is a rich supply of topics such as cryptography, factoring algorithms for integers, quadratic residues, finite fields, factoring algorithms for polynomials, and systems of non-linear equations. A special feature is that Gr"obner bases do not appear as an isolated example. They are fully integrated as a subject that can be successfully taught in an undergraduate context. Lauritzen's approach to teaching abstract algebra is based on an extensive use of examples, applications, and exercises. The basic philosophy is that inspiring, non-trivial applications and examples give motivation and ease the learning of abstract concepts. This book is built on several years of experienced teaching introductory abstract algebra at Aarhus, where the emphasis on concrete and inspiring examples has improved student performance significantly.

✦ Subjects


Математика;Общая алгебра;


📜 SIMILAR VOLUMES


Gröbner Bases: A Computational Approach
✍ Thomas Becker, Volker Weispfenning, H. Kredel 📂 Library 📅 1998 🏛 Springer 🌐 English

This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the G

Gröbner Bases: A Computational Approach
✍ Thomas Becker, Volker Weispfenning (auth.) 📂 Library 📅 1993 🏛 Springer-Verlag New York 🌐 English

<p>The origins of the mathematics in this book date back more than two thou­ sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek mathematician Eu­ clid. The word "algorithm" as well as the key word "algebra" in the title of th

Algorithmic Algebraic Combinatorics and
✍ Mikhail Klin, Gareth A. Jones, Aleksandar Jurisic, Mikhail Muzychuk, Ilia Ponoma 📂 Library 📅 2009 🏛 Springer 🌐 English

<P>This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Gröbner bases. </P> <P>Topics covered include coherent configur