Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to present it in their lively and humorous style, interspersing core content with funny quotations and tongue-in-cheek explanations.

Mathematics. --- Commutative algebra. --- Commutative rings. --- Matrix theory. --- Algebra. --- Commutative Rings and Algebras. --- Linear and Multilinear Algebras, Matrix Theory. --- Math --- Mathematics --- Mathematical analysis --- Algebra --- Rings (Algebra)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical logic --- Algebra --- Geometry --- Computer science --- Computer architecture. Operating systems --- algebra --- landmeetkunde --- informatica --- algoritmen

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computational Commutative Algebra 2 is the natural continuation of Computational Commutative Algebra 1 with some twists, starting with the differently coloured cover graphics. The first volume had 3 chapters, 20 sections, 44 tutorials, and some amusing quotes. Since bigger is better, this book contains 3 chapters filling almost twice as many pages, 23 sections (some as big as a whole chapter), and 55 tutorials (some as big as a whole section). The number of jokes and quotes has increased exponentially due to the little-known fact that a good mathematical joke is better than a dozen mediocre papers. The main part of this book is a breathtaking passeggiata through the computational domains of graded rings and modules and their Hilbert functions. Besides Gröbner bases, we encounter Hilbert bases, border bases, SAGBI bases, and even SuperG bases. The tutorials traverse areas ranging from algebraic geometry and combinatorics to photogrammetry, magic squares, coding theory, statistics, and automatic theorem proving. Whereas in the first volume gardening and chess playing were not treated, in this volume they are. This is a book for learning, teaching, reading, and most of all, enjoying the topic at hand. The theories it describes can be applied to anything from children's toys to oil production. If you buy it, probably one spot on your desk will be lost forever!

Mathematical logic --- Algebra --- Geometry --- Computer science --- Computer architecture. Operating systems --- algebra --- landmeetkunde --- informatica --- algoritmen

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Cryptography has become essential as bank transactions, credit card infor-mation, contracts, and sensitive medical information are sent through inse-cure channels. This book is concerned with the mathematical, especially algebraic, aspects of cryptography. It grew out of many courses presented by the authors over the past twenty years at various universities and covers a wide range of topics in mathematical cryptography. It is primarily geared towards graduate students and advanced undergraduates in mathematics and computer science, but may also be of interest to researchers in the area. Besides the classical methods of symmetric and private key encryption, the book treats the mathematics of cryptographic protocols and several unique topics such as Group-Based Cryptography Gröbner Basis Methods in Cryptography Lattice-Based Cryptography

Coding theory --- Cryptography --- Textbooks.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)