BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240924T163000
DTEND;TZID=Asia/Seoul:20240924T173000
DTSTAMP:20260415T175341
CREATED:20240721T112741Z
LAST-MODIFIED:20240913T040647Z
UID:9602-1727195400-1727199000@dimag.ibs.re.kr
SUMMARY:Gábor Tardos\, Extremal theory of 0-1 matrices
DESCRIPTION:We say that a 0-1 matrix A contains another such matrix (pattern) P if P can be obtained from a submatrix of A by possibly changing a few 1 entries to 0. The main question of this theory is to estimate the maximal number of 1 entries in an n by n 0-1 matrix NOT containing a given pattern P. This question has very close connections to Turan type extremal graph theory and also to the Devenport-Schinzel theory of sequences. Results in the extremal theory of 0-1 matrices proved useful in attacking problems in far away fields as combinatorial geometry and the analysis of algorithms. \nThis talk will concentrate on acyclic patterns and survey some old and recent results in the area and will also contain several open problems.
URL:https://dimag.ibs.re.kr/event/2024-09-24/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR