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

New to the Third Edition

· Two full new chapters covering linear and Reed–Muller-type codes (chapter 9), and the containment problem and the resurgence of ideals (chapter 16)

· Extensive addition of new sections throughout the existing chapters to bring the book up-to-date and make it even more comprehensive

· A new appendix detailing software procedures for use alongside the book.

Bringing together several areas of pure and applied mathematics, this book shows how monomial algebras are related to polyhedral geometry, combinatorial optimization, and combinatorics of hypergraphs. It directly links the algebraic properties of monomial algebras to combinatorial structures (such as simplicial complexes, posets, digraphs, graphs, and clutters) and linear optimization problems.