BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251121T114019EST-6724ezGuSB@132.216.98.100
DTSTAMP:20251121T164019Z
DESCRIPTION:Matching Polynomials of Covers of Graphs.\n\nGiven a connected 
 undirected graph G there is a notion of a cover H of G and degree of the c
 over.  If G is finite\, there are finitely many covers of fixed degree d\,
  and one can form interesting averages over the family of such covers. For
  example\, the average matching polynomial M_H(T) is something we call a d
 -matchings polynomial M_{d\,G}(T).  The same polynomial arises when one av
 erages the `new part' of the characteristic polynomial of the adjacency ma
 trix A(H) for covers of degree *d+1*.  We will elaborate on these points a
 nd discuss interesting number-theoretic properties possessed by M_{d\,G}(T
 ).  If time permits\, we will mention some open problems and also indicate
  other averages one might consider.\n
DTSTART:20170324T143000Z
DTEND:20170324T160000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Chris Wall\, UWO
URL:/mathstat/channels/event/chris-wall-uwo-267231
END:VEVENT
END:VCALENDAR