BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Gilyoung Cheong (UC Irvine)
DTSTART:20230202T220000Z
DTEND:20230202T230000Z
DTSTAMP:20260423T024730Z
UID:UCSD_NTS/88
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/UCSD_NTS/88/
 ">Polynomial equations for matrices over integers modulo a prime power and
  the cokernel of a random matrix</a>\nby Gilyoung Cheong (UC Irvine) as pa
 rt of UCSD number theory seminar\n\nLecture held in APM 6402 and online.\n
 \nAbstract\nOver a commutative ring of finite cardinality\, how many $n \\
 times n$ matrices satisfy a polynomial equation? In this talk\, I will exp
 lain how to solve this question when the ring is given by integers modulo 
 a prime power and the polynomial is square-free modulo the prime. Then I w
 ill discuss how this question is related to the distribution of the cokern
 el of a random matrix and the Cohen--Lenstra heuristics. This is joint wor
 k with Yunqi Liang and Michael Strand\, as a result of a summer undergradu
 ate research I mentored.\n\npre-talk at 1:20pm\n
LOCATION:https://researchseminars.org/talk/UCSD_NTS/88/
END:VEVENT
END:VCALENDAR