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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240618T163000
DTEND;TZID=Asia/Seoul:20240618T173000
DTSTAMP:20260416T201641
CREATED:20240330T144427Z
LAST-MODIFIED:20240707T071910Z
UID:8450-1718728200-1718731800@dimag.ibs.re.kr
SUMMARY:Semin Yoo (유세민)\, Paley-like quasi-random graphs arising from polynomials
DESCRIPTION:We provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum graphs. These graphs give a unified perspective of studying various graphs defined by polynomials over finite fields\, such as Paley graphs\, Paley sum graphs\, and graphs associated with Diophantine tuples and their generalizations from number theory. As an application\, we provide new lower bounds on the clique number and independence number of general quasi-random graphs. In particular\, we give a sufficient condition for the clique number of quasi-random graphs of order $n$ to be at least $(1-o(1))\log_{3.008}n$. Such a condition applies to many classical quasi-random graphs\, including Paley graphs and Paley sum graphs\, as well as some new Paley-like graphs we construct. If time permits\, we also discuss some problems of diophantine tuples arising from number theory\, which is our original motivation. \nThis is joint work with Seoyoung Kim and Chi Hoi Yip.
URL:https://dimag.ibs.re.kr/event/2024-06-18/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR