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:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce8ac499935
DTSTART;TZID=America/Toronto:20251103T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251103T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-theodore-morrison
SUMMARY:Graphs and Matroids - Theodore Morrison
CLASS:PUBLIC
DESCRIPTION:TITLE:The satisfiability threshold and solution space of random
 \nuniquely extendable CSPs\n\nSPEAKER:\n Theodore Morrison\n\nAFFILIATION:
 \n University of Waterloo\n\nROOM:\n MC 6029\n\nABSTRACT: A random constr
 aint satisfaction problem (CSP) consists of\na set of variables and a set 
 of randomly chosen constraints. Many\ncommonly studied CSPs are constructe
 d by choosing constraints of a\nspecific form. One such problem is $k$-UE-
 SAT\, where each constraint\nis chosen from the set of uniquely extendable
  (UE) constraints. A\nconjecture due to Molloy and Connamacher gives an ex
 act value for the\nhigh probability satisfiability threshold of $k$-UE-SAT
  problems. We\nmake progress towards this conjecture by showing that a su
 bclass of\nrandom CSPs with UE constraints has the conjectured satisfiabil
 ity\nthreshold. We also describe the solution space geometry for this clas
 s\nof CSPs\, and make further conjectures about the general $k$-UE-SAT\npr
 oblem.This talk is based on joint work with Jane Gao.
DTSTAMP:20260402T152700Z
END:VEVENT
END:VCALENDAR