BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea681740b3
DTSTART;TZID=America/Toronto:20251023T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251023T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-krystal-guo
SUMMARY:Algebraic and enumerative combinatorics seminar-Krystal Guo
CLASS:PUBLIC
DESCRIPTION:TITLE: Counting Substructures in Hypergraphs with Spectrum\n\nS
 peaker\n Krystal Guo\n\nAffiliation\n Korteweg-de Vries Institute for Math
 ematics\, University of\nAmsterdam \n\nLocation\n MC 6029\n\nABSTRACT: Ja
 cobi’s classical result expresses the generating\nfunction for closed wa
 lks at a vertex of a graph as the ratio of two\ncharacteristic polynomials
 . We find a hypergraph analogue of this\nrelationship\, showing that the s
 ame rational function for a hypergraph\nalso counts combinatorial substruc
 tures within it\, called infragraphs.\nWe use Viennot’s Heaps of Pieces 
 framework to establish this result\nfor the adjacency tensor of a hypergra
 ph. As an immediate consequence\,\nwe obtain an alternative proof for the 
 monotonicity of the principal\neigenvalue of a hypergraph. This is based o
 n joint work with Joshua\nCooper and Utku Okur (arXiv: 2411.03567).\n\nTHE
 RE WILL BE A PRE-SEMINAR PRESENTING RELEVANT BACKGROUND AT THE\nBEGINNING 
 GRADUATE LEVEL STARTING AT 1:30PM.
DTSTAMP:20260402T172521Z
END:VEVENT
END:VCALENDAR