Sign In / Sign Out
Navigation for Entire University
- ASU Home
- My ASU
- Colleges and Schools
- Map and Locations
(joint work with Aldo Conca)
An orthogonal representation of a graph is a map from the vertex set of an undirected graph to d-dimensional real space such that vertices not connected by an edge are sent to orthogonal vectors. Lovasz defined this concept in the 70s motivated by the study of the Shannon capacity of a graph.
Optimizing over all orthonormal representations allowed him to define the Lovasz number of a graph. Later joint with Saks and Schrijver he studied the set of all orthogonal representations of a given graph from a geometric point. We follow up on this from the algebraic side and provide results on the limiting behavior of the defining ideal of orthogonal representations when d goes to infinity. We also exhibit relations to ideals of minors.
The talk will focus on introducing orthogonal representations and recalling their motivation. Then we will introduce the geometric perspective of Lovasz, Saks, Schrijver before we come to our own results at the end