BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230704T163000
DTEND;TZID=Asia/Seoul:20230704T173000
DTSTAMP:20260419T042608
CREATED:20230627T045021Z
LAST-MODIFIED:20240705T162129Z
UID:7316-1688488200-1688491800@dimag.ibs.re.kr
SUMMARY:Tuan Tran\, Complexity of null dynamical systems
DESCRIPTION:A theoretical dynamical system is a pair (X\,T) where X is a compact metric space and T is a self homeomorphism of X. The topological entropy of a theoretical dynamical system (X\,T)\, first introduced in 1965 by Adler\, Konheim and McAndrew\, is a nonnegative real number that measures the complexity of the system. Systems with positive entropy are random in certain sense\, and systems with zero entropy are said to be deterministic. To distinguish between deterministic systems\, Huang and Ye (2009) introduced the concept of maximal pattern entropy of a theoretical dynamical system. At the heart of their argument is a Sauer-Shelah-type lemma. We will discuss this lemma and its surprising connection to a recent breakthrough in communication complexity. \nJoint work with Guorong Gao\, Jie Ma\, and Mingyuan Rong.
URL:https://dimag.ibs.re.kr/event/2023-07-04/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR