BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Priyanga Ganesan (Texas A&M)
DTSTART:20211215T200000Z
DTEND:20211215T210000Z
DTSTAMP:20260420T052928Z
UID:NYC-NCG/83
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NYC-NCG/83/"
 >Spectral bounds for chromatic number of quantum graphs</a>\nby Priyanga G
 anesan (Texas A&M) as part of Noncommutative geometry in NYC\n\n\nAbstract
 \nQuantum graphs are a non-commutative generalization of classical graphs 
 that have appeared in different branches of mathematics including operator
  algebras\, non-commutative topology and quantum information theory. In th
 is talk\, I will review the different perspectives to quantum graphs and i
 ntroduce a chromatic number for quantum graphs using a non-local game with
  quantum inputs and classical outputs. I will then show that many spectral
  lower bounds for chromatic numbers in the classical case (such as Hoffman
 ’s bound) also hold in the setting of quantum graphs. This is achieved u
 sing an algebraic formulation of quantum graph coloring and tools from lin
 ear algebra.\n
LOCATION:https://researchseminars.org/talk/NYC-NCG/83/
END:VEVENT
END:VCALENDAR