BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260317T103853
DTSTART;TZID=America/Detroit:20260318T143000
DTEND;TZID=America/Detroit:20260318T153000
SUMMARY:Workshop / Seminar:Learning seminar in algebraic combinatorics: The Fundamental Theorem of Finite Semidistributive Lattices
DESCRIPTION:Last time\, we saw that the lattice of torsion classes is completely semidistributive. Motivated in part by this fact\, Reading–Speyer–Thomas proved a fundamental theorem of finite semidistributive lattices. We'll give the necessary definitions to state the theorem\, give some examples\, and explain the connection to torsion classes. Time permitting\, we will also describe canonical join representations and the canonical join complex of a finite semidistributive lattice.
UID:146675-21899445@events.umich.edu
URL:https://events.umich.edu/event/146675
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4088
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20260316T091303
DTSTART;TZID=America/Detroit:20260318T143000
DTEND;TZID=America/Detroit:20260318T153000
SUMMARY:Workshop / Seminar:Student Number Theory: Counting points on hyperelliptic curves over finite fields
DESCRIPTION:I will explain elementary methods for computing the zeta function of an arithmetic scheme over a finite field\, focusing on the case of hyperelliptic curves. It turns out that the number of points on such curves over a finite field can be packaged into traces of certain explicit matrices (called Hasse-Witt matrices) constructed from some coefficients of suitable powers of the defining polynomial. A highlight of this approach is that it is entirely elementary\, in the sense that no cohomology is involved. I will also discuss efficient algorithms for computation and their complexity.
UID:146639-21899375@events.umich.edu
URL:https://events.umich.edu/event/146639
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 3088
CONTACT:
END:VEVENT
END:VCALENDAR