Speaker: K. Sather-Wagstaff, Clemson University, South Carolina.
Date/Time: 25 February 2022, 6:30pm IST/ 1:00pm GMT / 8:00am ET (joining
time 5:15pm IST).
Gmeet link: meet.google.com/rco-ewra-xmh
Title: Monomial Ideals Arising from Graph Domination Problems.
Abstract: Graph domination problems are ubiquitous in graph theory. In the
broadest terms, they ask how one can ‘observe’ an entire graph by
designating a certain list of vertices, following a proscribed list of
rules. An example of this is the vertex covering problem which happens to
describe the irredundant irreducible decomposition of the edge ideal of a
graph. In this talk, we will survey recent work with various collaborators
on other monomial ideal constructions that arise from other graph
domination problems, including one coming from electrical engineering.
For more information and links to previous seminars, visit the website of
VCAS:
https://sites.google.com/view/virtual-comm-algebra-seminar