BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Mathematics - ECPv5.10.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Mathematics
X-ORIGINAL-URL:https://math.unc.edu
X-WR-CALDESC:Events for Department of Mathematics
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211028T160000
DTEND;TZID=America/New_York:20211028T170000
DTSTAMP:20211201T010450
CREATED:20210901T183944Z
LAST-MODIFIED:20211020T165441Z
UID:7122-1635436800-1635440400@math.unc.edu
SUMMARY:Lilian Pierce\, Duke University - Mathematics Colloquium
DESCRIPTION:Lilian Pierce\, Duke University \nMode: Zoom \nTime: 4:00 pm – 5:00 pm \nVirtual Tea-time starting at 3:45pm \nTitle: Counting problems: open questions in number theory \nAbstract: Many questions in number theory can be phrased as counting problems. How many primes are there? How many elliptic curves are there? How many integral solutions to this system of equations are there? How many number fields are there? Sometimes the answer is “infinitely many\,” and then we want to understand the order of growth for the “family” of objects we are counting. In other settings\, we might want to show the answer really is “very few indeed.” In this talk\, we will explore how both types of counting problem can be related to each other. In particular\, we will trace one “simple” problem from the 1600’s as it has evolved into a deeply connected web of mysterious “counting problems” that may take decades (centuries?) to solve. This talk intends to be radically accessible to students and researchers in all areas of math. \n
URL:https://math.unc.edu/event/lilian-pierce-duke-university-mathematics-colloquium/
CATEGORIES:Mathematics Colloquium
END:VEVENT
END:VCALENDAR