BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260421T121500
DTEND;TZID=America/Los_Angeles:20260421T131000
DTSTAMP:20260416T134541
CREATED:20260123T053557Z
LAST-MODIFIED:20260415T053435Z
UID:3972-1776773700-1776777000@colleges.claremont.edu
SUMMARY:Diophantine avoidance\, primitive elements\, and normal basis theorem (Sehun Jeong\, CMC)
DESCRIPTION:Diophantine avoidance has been studied by several authors in recent years. This refers to effective results on existence of points of bounded size in a given algebraic set avoiding some specified subsets. The famous primitive element theorem states that every number field K is of the form Q(a) for some element a in K. From the proof of this theorem\, it is clear that not only there are infinitely many such primitive elements in K\, but in fact most elements in K are primitive. One natural question to ask is about finding a primitive element of small “size”\, where we use a height function to measure size. We discuss the conjecture of Ruppert and known results in this direction\, as well as our recent work on this problem. In addition\, we provide the standard and effective version of normal basis theorem\, obtaining an explicit bound in terms of the degree and discriminant of K\, where K/Q is a Galois extension. At the end\, we discuss a particularly good bound in the case of prime degree. This is joint work with Lenny Fukshansky.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sehun-jeong-cmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260428T121500
DTEND;TZID=America/Los_Angeles:20260428T131000
DTSTAMP:20260416T134541
CREATED:20260123T011543Z
LAST-MODIFIED:20260123T011543Z
UID:3970-1777378500-1777381800@colleges.claremont.edu
SUMMARY:ANTC talk -- Tom Gannon (UCR)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-tom-gannon-ucr/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260505T121500
DTEND;TZID=America/Los_Angeles:20260505T131000
DTSTAMP:20260416T134541
CREATED:20260119T224840Z
LAST-MODIFIED:20260209T235152Z
UID:3962-1777983300-1777986600@colleges.claremont.edu
SUMMARY:ANTC talk -- Michael Orrison (HMC)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michael-orrison-hmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR