BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LACIM - ECPv5.0.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LACIM
X-ORIGINAL-URL:http://lacim.uqam.ca
X-WR-CALDESC:Events for LACIM
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200605T110000
DTEND;TZID=America/New_York:20200605T120000
DTSTAMP:20200813T002846
CREATED:20200507T223526Z
LAST-MODIFIED:20200520T122250Z
UID:17153-1591354800-1591358400@lacim.uqam.ca
SUMMARY:Liana Yepremyan ( London School of Economics and Political Science\, University of Illinois at Chicago) Ryser's conjecture and more
DESCRIPTION:A Latin square of order $n$ is an $n \times n$ array filled with $n$ symbols such that each symbol appears only once in every row or column and a transversal is a collection of cells which do not share the same row\, column or symbol. The study of Latin squares goes back more than 200 years to the work of Euler. One of the most famous open problems in this area is a conjecture of Ryser\, Brualdi and Stein from 60s which says that every Latin square of order $n\times n$ contains a transversal of order $n-1$. A closely related problem is 40 year old conjecture of Brouwer that every Steiner triple system of order $n$ contains a matching of size $(n-4)/3$. The third problem we’d like to mention asks how many distinct symbols in Latin arrays suffice to guarantee a full transversal? In this talk we discuss a novel approach to attack these problems. \nJoint work with Peter Keevash\, Alexey Pokrovskiy and Benny Sudakov. \n
URL:http://lacim.uqam.ca/event/liana-yepremyan-university-of-illinois-in-chicago/
LOCATION:En ligne/online\, Canada
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR