Explore a 22-minute lecture by Keri Sather-Wagstaff from Clemson University on monomial ideals and their connections to graph theory and coding theory. Delve into the intricate relationships between algebraic structures and their applications in discrete mathematics. Gain insights into how these mathematical concepts intersect and influence each other, as presented at the Fields Institute as part of the "Spec(Q-bar)" series on July 8th, 2022.
Monomial Ideals Arising from Graph Theory and Coding Theory
Overview
Syllabus
Monomial Ideals Arising from Graph Theory and Coding Theory
Taught by
Fields Institute
Related Courses
-
On the Equality of Test Ideals
-
Embedding DM Stacks into GIT Quotient Stacks of Linear Representations
-
Algebraic Graph Theory and Quantum Computing - Lecture 2
-
Algebraic Graph Theory and Quantum Computing - Lecture 4
-
Algebraic Graph Theory and Quantum Computing - Lecture 3
-
Algebraic Graph Theory and Quantum Computing - Lecture 12
