Skip to main content

Research Community · No. 965

Inverse eigenvalue problems for graphs

at the American Institute of Mathematics

Dates

Feb. 1, 2021 – March 31, 2031

Organized by

Mary Flagg
Jephian Lin
Bryan Shader

This workshop, sponsored by AIM and the NSF, This AIM Research Community (ARC), sponsored by AIM and the NSF, began in 2021 and focuses on combinatorial and linear algebraic problems related to inverse eigenvalue problems related to graphs. The inverse eigenvalue problem for graphs (IEPG) is to determine if a given set of real numbers is the spectrum of a matrix with a given graph. This problem and related variants have been of interest for many years and recently developed tools have accelerated progress and opened up new lines of inquiry. Zero forcing (ZF) is a propagation process on graphs. ZF has become a fundamental concept because it represents a nice bridge between combinatorics and linear algebra. ZF has also arisen independently in quantum information processing, monitoring electrical power networks, and graph search algorithms. The primary scientific goals of this AIM research community are to: 1) use all the tools--recently developed matrix theoretic ones, combinatorial approaches developed for ZF and other tools from algebra and analysis--to make significant progress on the IEPG; and 2) investigate new lines of zero forcing (ZF) and its variants. For more information see https://qubeshub.org/community/groups/iepgzfarc or contact AIM Director of Research Communities Leslie Hogben hogben@aimath.org.

This event will be run as an AIM-style workshop. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and the schedule will include discussion and parallel working sessions.