for this workshop
Spectral graph and hypergraph theory: connections and applications
American Institute of Mathematics, San Jose, California
Sebastian Cioaba, Krystal Guo, and Nikhil Srivastava
This workshop, sponsored by AIM and the NSF, will be devoted to spectral graph theory and its extensions to digraphs and hypergraphs. Graph theory is the mathematics of networks. A graph can be described entirely by various matrices, which provides a natural tie between linear algebra and discrete mathematics. The linear algebraic properties of these matrices have surprising connections to the combinatorial properties of the graph; these connections form the basis of spectral graph theory. In recent years, these notions have been extended and used with great success for signed graphs, directed graphs, hypergraphs and simplicial complexes. During this workshop, we will concentrate on the following topics:
- Spectral problems on graphs and signed graphs.
- Adjacency matrices of directed and oriented graphs.
- Spectral bounds on hypergraphs and simplicial complexes.
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.
The deadline to apply for support to participate in this workshop has passed.
For more information email email@example.com