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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20251216T163000
DTEND;TZID=Asia/Seoul:20251216T173000
DTSTAMP:20260416T090606
CREATED:20251128T074641Z
LAST-MODIFIED:20251128T074641Z
UID:11891-1765902600-1765906200@dimag.ibs.re.kr
SUMMARY:Chi Hoi Yip\, Cliques in Paley graphs and cyclotomic graphs
DESCRIPTION:Given a prime power $q \equiv 1 \pmod 4$\, the Paley graph of order $q$ is the graph defined over $\mathbb{F}_q$ (the finite field with $q$ elements)\, such that two vertices are adjacent if and only if their difference is a square in $\mathbb{F}_q$. In this talk\, I will present some recent progress on the clique number of Paley graphs of non-square order\, the characterization of maximum cliques in Paley graphs of square order\, as well as their extensions to cyclotomic graphs. In particular\, I will highlight a new proof of the Van Lint–MacWilliams’ conjecture using ideas from arithmetic combinatorics.
URL:https://dimag.ibs.re.kr/event/2025-12-16/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR