Features • Presents computational and combinatorial methods in commutative algebra • Shows how to solve a variety of problems of monomial algebras • Covers various affine and graded rings, including Cohen–Macaulay, complete intersection, and normal • Examines their basic algebraic invariants, such as multiplicity, Betti numbers, projective dimension, and Hilbert polynomial • Contains over 550 exercises and over 50 examples, many of which illustrate the use of computer algebra systems Summary Monomial Algebras, Second Edition presents algebraic, combinatorial, and computational methods for studying monomial algebras and their ideals, including Stanley–Reisner rings, monomial subrings, Ehrhart rings, and blowup algebras. It emphasizes square-free monomials and the corresponding graphs, clutters, or hypergraphs.
- Choosing a selection results in a full page refresh.
- Press the space key then arrow keys to make a selection.
- Use left/right arrows to navigate the slideshow or swipe left/right if using a mobile device