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...

Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples.Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point...