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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cfd97fc13d0
DTSTART;TZID=America/Toronto:20220118T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220118T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-mehtaab-sawhney
SUMMARY:Graphs and Matroids Seminar - Mehtaab Sawhney
CLASS:PUBLIC
DESCRIPTION:TITLE: Enumerating Matroids and Linear Spaces\n\nSpeaker:\n Me
 htaab Sawhney\n\nAffiliation:\n MIT\n\nZoom:\n Please email Shayla Redlin\
 n\nABSTRACT:\n\nWe show that the number of linear spaces on a set of $n$ p
 oints and\nthe number of rank-3 matroids on a ground set of size $n$ are b
 oth of\nthe form $(cn+o(n))^{n^2/6}$\, where $c=e^{\\sqrt 3/2-3}(1+\\sqrt 
 3)/2$.\nThis is the final piece of the puzzle for enumerating fixed-rank\n
 matroids at this level of accuracy: there are exact formulas for\nenumerat
 ion of rank-1 and rank-2 matroids\, and it was recently proved\nby van der
  Hofstad\, Pendavingh\, and van der Pol that for constant\n$r\\ge 4$ there
  are $(e^{1-r}n+o(n))^{n^{r-1}/r!}$ rank-$r$ matroids on\na ground set of 
 size $n$.
DTSTAMP:20260403T151511Z
END:VEVENT
END:VCALENDAR